./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.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.h_FourbyFour.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 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 19:13:38,518 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 19:13:38,557 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-05 19:13:38,561 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 19:13:38,561 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 19:13:38,575 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 19:13:38,576 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 19:13:38,576 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 19:13:38,576 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 19:13:38,577 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 19:13:38,577 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 19:13:38,577 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 19:13:38,577 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 19:13:38,578 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 19:13:38,578 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 19:13:38,579 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 19:13:38,579 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 19:13:38,580 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 19:13:38,580 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 -> 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af
[2025-02-05 19:13:38,781 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 19:13:38,787 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 19:13:38,788 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 19:13:38,789 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 19:13:38,789 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 19:13:38,790 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.h_FourbyFour.c
[2025-02-05 19:13:39,947 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c79afb24b/6d6430cb89f14da3a3ae9713b68ae340/FLAGb0fafb2ca
[2025-02-05 19:13:40,319 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 19:13:40,320 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c
[2025-02-05 19:13:40,336 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c79afb24b/6d6430cb89f14da3a3ae9713b68ae340/FLAGb0fafb2ca
[2025-02-05 19:13:40,548 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c79afb24b/6d6430cb89f14da3a3ae9713b68ae340
[2025-02-05 19:13:40,550 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 19:13:40,551 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 19:13:40,552 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 19:13:40,553 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 19:13:40,557 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 19:13:40,558 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:13:40" (1/1) ...
[2025-02-05 19:13:40,560 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:40, skipping insertion in model container
[2025-02-05 19:13:40,561 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:13:40" (1/1) ...
[2025-02-05 19:13:40,602 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 19:13:40,726 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.h_FourbyFour.c[1252,1265]
[2025-02-05 19:13:40,980 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 19:13:40,986 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 19:13:40,994 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.h_FourbyFour.c[1252,1265]
[2025-02-05 19:13:41,176 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 19:13:41,187 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 19:13:41,188 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41 WrapperNode
[2025-02-05 19:13:41,188 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 19:13:41,189 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 19:13:41,189 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 19:13:41,189 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 19:13:41,195 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:41,247 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:41,684 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4219
[2025-02-05 19:13:41,685 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 19:13:41,685 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 19:13:41,685 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 19:13:41,685 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 19:13:41,699 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:41,699 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:41,829 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,000 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 19:13:42,001 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,003 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,145 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,162 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,183 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,203 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,250 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 19:13:42,252 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 19:13:42,252 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 19:13:42,252 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 19:13:42,253 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (1/1) ...
[2025-02-05 19:13:42,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 19:13:42,267 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 19:13:42,285 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 19:13:42,290 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 19:13:42,306 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 19:13:42,307 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 19:13:42,307 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 19:13:42,307 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 19:13:42,649 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 19:13:42,651 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 19:13:45,611 INFO  L?                        ?]: Removed 2712 outVars from TransFormulas that were not future-live.
[2025-02-05 19:13:45,612 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 19:13:45,721 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 19:13:45,721 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 19:13:45,722 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:13:45 BoogieIcfgContainer
[2025-02-05 19:13:45,722 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 19:13:45,724 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 19:13:45,724 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 19:13:45,727 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 19:13:45,727 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:13:40" (1/3) ...
[2025-02-05 19:13:45,727 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7518bd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:13:45, skipping insertion in model container
[2025-02-05 19:13:45,727 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:13:41" (2/3) ...
[2025-02-05 19:13:45,728 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7518bd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:13:45, skipping insertion in model container
[2025-02-05 19:13:45,728 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:13:45" (3/3) ...
[2025-02-05 19:13:45,729 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FourbyFour.c
[2025-02-05 19:13:45,740 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 19:13:45,741 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FourbyFour.c that has 1 procedures, 1129 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 19:13:45,792 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 19:13:45,801 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;@6ec1bb74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 19:13:45,802 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 19:13:45,807 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1129 states, 1127 states have (on average 1.502218278615794) internal successors, (1693), 1128 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:45,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2025-02-05 19:13:45,816 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:45,816 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:45,817 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:45,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:45,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -934359406, now seen corresponding path program 1 times
[2025-02-05 19:13:45,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:45,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677993381]
[2025-02-05 19:13:45,831 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:45,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:46,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes.
[2025-02-05 19:13:46,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements.
[2025-02-05 19:13:46,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:46,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:47,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:47,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:47,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677993381]
[2025-02-05 19:13:47,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677993381] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:47,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:47,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:13:47,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662377459]
[2025-02-05 19:13:47,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:47,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:13:47,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:47,483 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:13:47,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:13:47,488 INFO  L87              Difference]: Start difference. First operand  has 1129 states, 1127 states have (on average 1.502218278615794) internal successors, (1693), 1128 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:48,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:48,112 INFO  L93              Difference]: Finished difference Result 2215 states and 3325 transitions.
[2025-02-05 19:13:48,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:13:48,116 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219
[2025-02-05 19:13:48,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:48,136 INFO  L225             Difference]: With dead ends: 2215
[2025-02-05 19:13:48,138 INFO  L226             Difference]: Without dead ends: 1128
[2025-02-05 19:13:48,145 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 19:13:48,147 INFO  L435           NwaCegarLoop]: 1409 mSDtfsCounter, 0 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:48,150 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4222 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:13:48,164 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1128 states.
[2025-02-05 19:13:48,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128.
[2025-02-05 19:13:48,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1128 states, 1127 states have (on average 1.5004436557231589) internal successors, (1691), 1127 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:48,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1691 transitions.
[2025-02-05 19:13:48,234 INFO  L78                 Accepts]: Start accepts. Automaton has 1128 states and 1691 transitions. Word has length 219
[2025-02-05 19:13:48,235 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:48,235 INFO  L471      AbstractCegarLoop]: Abstraction has 1128 states and 1691 transitions.
[2025-02-05 19:13:48,235 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:48,235 INFO  L276                IsEmpty]: Start isEmpty. Operand 1128 states and 1691 transitions.
[2025-02-05 19:13:48,238 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-02-05 19:13:48,238 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:48,238 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:48,238 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 19:13:48,239 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:48,239 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:48,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1104309828, now seen corresponding path program 1 times
[2025-02-05 19:13:48,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:48,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649752147]
[2025-02-05 19:13:48,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:48,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:48,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 19:13:48,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 19:13:48,411 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:48,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:48,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:48,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:48,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649752147]
[2025-02-05 19:13:48,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649752147] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:48,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:48,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:13:48,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855438389]
[2025-02-05 19:13:48,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:48,864 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:13:48,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:48,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:13:48,865 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:13:48,865 INFO  L87              Difference]: Start difference. First operand 1128 states and 1691 transitions. Second operand  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:49,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:49,303 INFO  L93              Difference]: Finished difference Result 2216 states and 3323 transitions.
[2025-02-05 19:13:49,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:13:49,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220
[2025-02-05 19:13:49,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:49,308 INFO  L225             Difference]: With dead ends: 2216
[2025-02-05 19:13:49,308 INFO  L226             Difference]: Without dead ends: 1130
[2025-02-05 19:13:49,309 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 19:13:49,310 INFO  L435           NwaCegarLoop]: 1409 mSDtfsCounter, 0 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:49,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4219 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:13:49,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1130 states.
[2025-02-05 19:13:49,324 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130.
[2025-02-05 19:13:49,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1130 states, 1129 states have (on average 1.49955713020372) internal successors, (1693), 1129 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:49,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1693 transitions.
[2025-02-05 19:13:49,329 INFO  L78                 Accepts]: Start accepts. Automaton has 1130 states and 1693 transitions. Word has length 220
[2025-02-05 19:13:49,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:49,330 INFO  L471      AbstractCegarLoop]: Abstraction has 1130 states and 1693 transitions.
[2025-02-05 19:13:49,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:49,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 1130 states and 1693 transitions.
[2025-02-05 19:13:49,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-02-05 19:13:49,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:49,332 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:49,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 19:13:49,332 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:49,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:49,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 1805376717, now seen corresponding path program 1 times
[2025-02-05 19:13:49,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:49,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762484511]
[2025-02-05 19:13:49,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:49,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:49,382 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-02-05 19:13:49,632 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-02-05 19:13:49,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:49,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:50,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:50,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:50,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762484511]
[2025-02-05 19:13:50,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762484511] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:50,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:50,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:13:50,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135481532]
[2025-02-05 19:13:50,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:50,593 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:13:50,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:50,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:13:50,594 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:13:50,594 INFO  L87              Difference]: Start difference. First operand 1130 states and 1693 transitions. Second operand  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:51,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:51,296 INFO  L93              Difference]: Finished difference Result 2218 states and 3324 transitions.
[2025-02-05 19:13:51,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:13:51,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221
[2025-02-05 19:13:51,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:51,301 INFO  L225             Difference]: With dead ends: 2218
[2025-02-05 19:13:51,301 INFO  L226             Difference]: Without dead ends: 1130
[2025-02-05 19:13:51,302 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 19:13:51,303 INFO  L435           NwaCegarLoop]: 1406 mSDtfsCounter, 272 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:51,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 3880 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 19:13:51,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1130 states.
[2025-02-05 19:13:51,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130.
[2025-02-05 19:13:51,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1130 states, 1129 states have (on average 1.4986713906111604) internal successors, (1692), 1129 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:51,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1692 transitions.
[2025-02-05 19:13:51,324 INFO  L78                 Accepts]: Start accepts. Automaton has 1130 states and 1692 transitions. Word has length 221
[2025-02-05 19:13:51,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:51,325 INFO  L471      AbstractCegarLoop]: Abstraction has 1130 states and 1692 transitions.
[2025-02-05 19:13:51,325 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:51,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 1130 states and 1692 transitions.
[2025-02-05 19:13:51,326 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-02-05 19:13:51,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:51,327 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:51,327 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 19:13:51,327 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:51,327 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:51,328 INFO  L85        PathProgramCache]: Analyzing trace with hash 2020467081, now seen corresponding path program 1 times
[2025-02-05 19:13:51,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:51,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846080895]
[2025-02-05 19:13:51,328 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:51,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:51,379 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-02-05 19:13:51,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-02-05 19:13:51,615 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:51,615 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:53,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:53,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:53,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846080895]
[2025-02-05 19:13:53,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846080895] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:53,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:53,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 19:13:53,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756246375]
[2025-02-05 19:13:53,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:53,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 19:13:53,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:53,131 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 19:13:53,131 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:13:53,131 INFO  L87              Difference]: Start difference. First operand 1130 states and 1692 transitions. Second operand  has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:54,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:54,125 INFO  L93              Difference]: Finished difference Result 2487 states and 3728 transitions.
[2025-02-05 19:13:54,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 19:13:54,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222
[2025-02-05 19:13:54,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:54,131 INFO  L225             Difference]: With dead ends: 2487
[2025-02-05 19:13:54,131 INFO  L226             Difference]: Without dead ends: 1399
[2025-02-05 19:13:54,133 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-02-05 19:13:54,133 INFO  L435           NwaCegarLoop]: 1399 mSDtfsCounter, 2282 mSDsluCounter, 6983 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 8382 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:54,134 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 8382 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 19:13:54,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1399 states.
[2025-02-05 19:13:54,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1398.
[2025-02-05 19:13:54,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1398 states, 1397 states have (on average 1.5003579098067288) internal successors, (2096), 1397 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:54,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2096 transitions.
[2025-02-05 19:13:54,163 INFO  L78                 Accepts]: Start accepts. Automaton has 1398 states and 2096 transitions. Word has length 222
[2025-02-05 19:13:54,164 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:54,164 INFO  L471      AbstractCegarLoop]: Abstraction has 1398 states and 2096 transitions.
[2025-02-05 19:13:54,164 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:54,164 INFO  L276                IsEmpty]: Start isEmpty. Operand 1398 states and 2096 transitions.
[2025-02-05 19:13:54,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-02-05 19:13:54,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:54,167 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:54,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 19:13:54,167 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:54,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:54,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 1914638981, now seen corresponding path program 1 times
[2025-02-05 19:13:54,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:54,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504453285]
[2025-02-05 19:13:54,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:54,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:54,234 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-02-05 19:13:54,406 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-02-05 19:13:54,406 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:54,406 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:56,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:56,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:56,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504453285]
[2025-02-05 19:13:56,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504453285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:56,003 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:56,003 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-05 19:13:56,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569350643]
[2025-02-05 19:13:56,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:56,003 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 19:13:56,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:56,004 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 19:13:56,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-02-05 19:13:56,004 INFO  L87              Difference]: Start difference. First operand 1398 states and 2096 transitions. Second operand  has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:57,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:57,096 INFO  L93              Difference]: Finished difference Result 2759 states and 4137 transitions.
[2025-02-05 19:13:57,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 19:13:57,097 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223
[2025-02-05 19:13:57,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:57,102 INFO  L225             Difference]: With dead ends: 2759
[2025-02-05 19:13:57,102 INFO  L226             Difference]: Without dead ends: 1403
[2025-02-05 19:13:57,104 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2025-02-05 19:13:57,104 INFO  L435           NwaCegarLoop]: 1396 mSDtfsCounter, 2285 mSDsluCounter, 8362 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 9758 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:57,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 9758 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 19:13:57,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1403 states.
[2025-02-05 19:13:57,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1402.
[2025-02-05 19:13:57,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1402 states, 1401 states have (on average 1.4996431120628122) internal successors, (2101), 1401 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:57,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2101 transitions.
[2025-02-05 19:13:57,182 INFO  L78                 Accepts]: Start accepts. Automaton has 1402 states and 2101 transitions. Word has length 223
[2025-02-05 19:13:57,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:57,183 INFO  L471      AbstractCegarLoop]: Abstraction has 1402 states and 2101 transitions.
[2025-02-05 19:13:57,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:57,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 1402 states and 2101 transitions.
[2025-02-05 19:13:57,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-02-05 19:13:57,185 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:57,185 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:57,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 19:13:57,185 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:57,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:57,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 1750479098, now seen corresponding path program 1 times
[2025-02-05 19:13:57,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:57,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451060115]
[2025-02-05 19:13:57,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:57,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:57,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-02-05 19:13:57,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-02-05 19:13:57,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:57,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:13:57,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:13:57,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:13:57,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451060115]
[2025-02-05 19:13:57,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451060115] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:13:57,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:13:57,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:13:57,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135025198]
[2025-02-05 19:13:57,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:13:57,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:13:57,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:13:57,585 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:13:57,585 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:13:57,588 INFO  L87              Difference]: Start difference. First operand 1402 states and 2101 transitions. Second operand  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:58,071 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:13:58,071 INFO  L93              Difference]: Finished difference Result 2764 states and 4143 transitions.
[2025-02-05 19:13:58,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:13:58,072 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223
[2025-02-05 19:13:58,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:13:58,077 INFO  L225             Difference]: With dead ends: 2764
[2025-02-05 19:13:58,078 INFO  L226             Difference]: Without dead ends: 1404
[2025-02-05 19:13:58,080 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:13:58,080 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:13:58,080 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:13:58,082 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1404 states.
[2025-02-05 19:13:58,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404.
[2025-02-05 19:13:58,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1404 states, 1403 states have (on average 1.4989308624376336) internal successors, (2103), 1403 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:58,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2103 transitions.
[2025-02-05 19:13:58,116 INFO  L78                 Accepts]: Start accepts. Automaton has 1404 states and 2103 transitions. Word has length 223
[2025-02-05 19:13:58,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:13:58,117 INFO  L471      AbstractCegarLoop]: Abstraction has 1404 states and 2103 transitions.
[2025-02-05 19:13:58,117 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:13:58,117 INFO  L276                IsEmpty]: Start isEmpty. Operand 1404 states and 2103 transitions.
[2025-02-05 19:13:58,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-02-05 19:13:58,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:13:58,120 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:13:58,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 19:13:58,121 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:13:58,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:13:58,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1523456908, now seen corresponding path program 1 times
[2025-02-05 19:13:58,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:13:58,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273546142]
[2025-02-05 19:13:58,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:13:58,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:13:58,172 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-02-05 19:13:58,773 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-02-05 19:13:58,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:13:58,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:00,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:00,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:00,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273546142]
[2025-02-05 19:14:00,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273546142] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:00,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:00,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 19:14:00,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423069252]
[2025-02-05 19:14:00,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:00,508 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 19:14:00,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:00,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 19:14:00,508 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:00,508 INFO  L87              Difference]: Start difference. First operand 1404 states and 2103 transitions. Second operand  has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:01,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:01,447 INFO  L93              Difference]: Finished difference Result 2800 states and 4194 transitions.
[2025-02-05 19:14:01,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 19:14:01,448 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224
[2025-02-05 19:14:01,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:01,452 INFO  L225             Difference]: With dead ends: 2800
[2025-02-05 19:14:01,452 INFO  L226             Difference]: Without dead ends: 1438
[2025-02-05 19:14:01,454 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:01,455 INFO  L435           NwaCegarLoop]: 1381 mSDtfsCounter, 1624 mSDsluCounter, 5512 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:01,455 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 6893 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 19:14:01,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1438 states.
[2025-02-05 19:14:01,477 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1428.
[2025-02-05 19:14:01,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1428 states, 1427 states have (on average 1.4975473020322354) internal successors, (2137), 1427 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:01,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2137 transitions.
[2025-02-05 19:14:01,484 INFO  L78                 Accepts]: Start accepts. Automaton has 1428 states and 2137 transitions. Word has length 224
[2025-02-05 19:14:01,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:01,484 INFO  L471      AbstractCegarLoop]: Abstraction has 1428 states and 2137 transitions.
[2025-02-05 19:14:01,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:01,485 INFO  L276                IsEmpty]: Start isEmpty. Operand 1428 states and 2137 transitions.
[2025-02-05 19:14:01,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-02-05 19:14:01,487 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:01,488 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:01,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 19:14:01,488 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:01,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:01,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -154680450, now seen corresponding path program 1 times
[2025-02-05 19:14:01,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:01,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839832501]
[2025-02-05 19:14:01,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:01,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:01,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-02-05 19:14:01,592 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-02-05 19:14:01,592 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:01,592 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:01,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:01,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:01,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839832501]
[2025-02-05 19:14:01,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839832501] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:01,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:01,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:01,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113143030]
[2025-02-05 19:14:01,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:01,888 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:01,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:01,888 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:01,888 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:01,889 INFO  L87              Difference]: Start difference. First operand 1428 states and 2137 transitions. Second operand  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:02,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:02,500 INFO  L93              Difference]: Finished difference Result 2822 states and 4224 transitions.
[2025-02-05 19:14:02,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:02,501 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225
[2025-02-05 19:14:02,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:02,505 INFO  L225             Difference]: With dead ends: 2822
[2025-02-05 19:14:02,505 INFO  L226             Difference]: Without dead ends: 1436
[2025-02-05 19:14:02,507 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:02,508 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:02,508 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:02,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1436 states.
[2025-02-05 19:14:02,527 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436.
[2025-02-05 19:14:02,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1436 states, 1435 states have (on average 1.494773519163763) internal successors, (2145), 1435 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:02,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2145 transitions.
[2025-02-05 19:14:02,535 INFO  L78                 Accepts]: Start accepts. Automaton has 1436 states and 2145 transitions. Word has length 225
[2025-02-05 19:14:02,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:02,536 INFO  L471      AbstractCegarLoop]: Abstraction has 1436 states and 2145 transitions.
[2025-02-05 19:14:02,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:02,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 1436 states and 2145 transitions.
[2025-02-05 19:14:02,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-02-05 19:14:02,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:02,538 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:02,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 19:14:02,539 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:02,540 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:02,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 861848259, now seen corresponding path program 1 times
[2025-02-05 19:14:02,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:02,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124624131]
[2025-02-05 19:14:02,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:02,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:02,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-02-05 19:14:02,683 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-02-05 19:14:02,683 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:02,683 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:03,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:03,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:03,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124624131]
[2025-02-05 19:14:03,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124624131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:03,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:03,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 19:14:03,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092156115]
[2025-02-05 19:14:03,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:03,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 19:14:03,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:03,007 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 19:14:03,007 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:03,007 INFO  L87              Difference]: Start difference. First operand 1436 states and 2145 transitions. Second operand  has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:03,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:03,962 INFO  L93              Difference]: Finished difference Result 2900 states and 4334 transitions.
[2025-02-05 19:14:03,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 19:14:03,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225
[2025-02-05 19:14:03,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:03,967 INFO  L225             Difference]: With dead ends: 2900
[2025-02-05 19:14:03,967 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 19:14:03,969 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:03,970 INFO  L435           NwaCegarLoop]: 1398 mSDtfsCounter, 35 mSDsluCounter, 8369 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 9767 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:03,970 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 9767 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 19:14:03,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 19:14:03,988 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1502.
[2025-02-05 19:14:03,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1502 states, 1501 states have (on average 1.4930046635576282) internal successors, (2241), 1501 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:03,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2241 transitions.
[2025-02-05 19:14:03,994 INFO  L78                 Accepts]: Start accepts. Automaton has 1502 states and 2241 transitions. Word has length 225
[2025-02-05 19:14:03,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:03,994 INFO  L471      AbstractCegarLoop]: Abstraction has 1502 states and 2241 transitions.
[2025-02-05 19:14:03,994 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:03,995 INFO  L276                IsEmpty]: Start isEmpty. Operand 1502 states and 2241 transitions.
[2025-02-05 19:14:03,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-02-05 19:14:03,997 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:03,997 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:03,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 19:14:03,997 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:03,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:03,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -369232593, now seen corresponding path program 1 times
[2025-02-05 19:14:03,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:03,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132388117]
[2025-02-05 19:14:03,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:03,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:04,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-02-05 19:14:04,089 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-02-05 19:14:04,089 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:04,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:04,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:04,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:04,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132388117]
[2025-02-05 19:14:04,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132388117] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:04,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:04,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:04,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049408661]
[2025-02-05 19:14:04,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:04,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:04,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:04,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:04,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:04,374 INFO  L87              Difference]: Start difference. First operand 1502 states and 2241 transitions. Second operand  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:04,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:04,952 INFO  L93              Difference]: Finished difference Result 2966 states and 4426 transitions.
[2025-02-05 19:14:04,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:04,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225
[2025-02-05 19:14:04,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:04,957 INFO  L225             Difference]: With dead ends: 2966
[2025-02-05 19:14:04,958 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 19:14:04,959 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:04,960 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:04,961 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:04,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 19:14:04,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 19:14:04,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.4916943521594683) internal successors, (2245), 1505 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:04,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2245 transitions.
[2025-02-05 19:14:04,988 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2245 transitions. Word has length 225
[2025-02-05 19:14:04,989 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:04,989 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2245 transitions.
[2025-02-05 19:14:04,989 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:04,989 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2245 transitions.
[2025-02-05 19:14:04,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-02-05 19:14:04,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:04,991 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:04,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 19:14:04,991 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:04,992 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:04,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -811830309, now seen corresponding path program 1 times
[2025-02-05 19:14:04,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:04,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977078132]
[2025-02-05 19:14:04,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:04,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:05,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 19:14:05,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 19:14:05,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:05,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:05,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:05,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:05,326 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977078132]
[2025-02-05 19:14:05,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977078132] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:05,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:05,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:05,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622208116]
[2025-02-05 19:14:05,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:05,327 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:05,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:05,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:05,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:05,328 INFO  L87              Difference]: Start difference. First operand 1506 states and 2245 transitions. Second operand  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:06,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:06,009 INFO  L93              Difference]: Finished difference Result 3036 states and 4528 transitions.
[2025-02-05 19:14:06,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:06,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-02-05 19:14:06,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:06,015 INFO  L225             Difference]: With dead ends: 3036
[2025-02-05 19:14:06,015 INFO  L226             Difference]: Without dead ends: 1572
[2025-02-05 19:14:06,017 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:06,018 INFO  L435           NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:06,018 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:06,020 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1572 states.
[2025-02-05 19:14:06,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1566.
[2025-02-05 19:14:06,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1566 states, 1565 states have (on average 1.4907348242811502) internal successors, (2333), 1565 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:06,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2333 transitions.
[2025-02-05 19:14:06,041 INFO  L78                 Accepts]: Start accepts. Automaton has 1566 states and 2333 transitions. Word has length 226
[2025-02-05 19:14:06,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:06,041 INFO  L471      AbstractCegarLoop]: Abstraction has 1566 states and 2333 transitions.
[2025-02-05 19:14:06,041 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:06,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 1566 states and 2333 transitions.
[2025-02-05 19:14:06,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-02-05 19:14:06,044 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:06,044 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:06,044 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 19:14:06,044 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:06,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:06,045 INFO  L85        PathProgramCache]: Analyzing trace with hash -1632473028, now seen corresponding path program 1 times
[2025-02-05 19:14:06,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:06,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723510020]
[2025-02-05 19:14:06,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:06,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:06,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 19:14:06,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 19:14:06,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:06,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:06,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:06,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:06,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723510020]
[2025-02-05 19:14:06,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723510020] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:06,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:06,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:06,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825516494]
[2025-02-05 19:14:06,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:06,569 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:06,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:06,569 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:06,569 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:06,569 INFO  L87              Difference]: Start difference. First operand 1566 states and 2333 transitions. Second operand  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:07,045 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:07,045 INFO  L93              Difference]: Finished difference Result 3096 states and 4614 transitions.
[2025-02-05 19:14:07,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:07,046 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-02-05 19:14:07,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:07,050 INFO  L225             Difference]: With dead ends: 3096
[2025-02-05 19:14:07,050 INFO  L226             Difference]: Without dead ends: 1572
[2025-02-05 19:14:07,052 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:07,052 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1583 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:07,053 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 4158 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:07,054 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1572 states.
[2025-02-05 19:14:07,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572.
[2025-02-05 19:14:07,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1572 states, 1571 states have (on average 1.49013367281986) internal successors, (2341), 1571 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:07,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2341 transitions.
[2025-02-05 19:14:07,072 INFO  L78                 Accepts]: Start accepts. Automaton has 1572 states and 2341 transitions. Word has length 226
[2025-02-05 19:14:07,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:07,072 INFO  L471      AbstractCegarLoop]: Abstraction has 1572 states and 2341 transitions.
[2025-02-05 19:14:07,073 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:07,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 1572 states and 2341 transitions.
[2025-02-05 19:14:07,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-02-05 19:14:07,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:07,075 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:07,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 19:14:07,075 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:07,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:07,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -229696719, now seen corresponding path program 1 times
[2025-02-05 19:14:07,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:07,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708021531]
[2025-02-05 19:14:07,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:07,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:07,114 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 19:14:07,199 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 19:14:07,199 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:07,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:07,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:07,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:07,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708021531]
[2025-02-05 19:14:07,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708021531] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:07,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:07,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:07,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228572517]
[2025-02-05 19:14:07,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:07,479 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:07,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:07,480 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:07,480 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:07,480 INFO  L87              Difference]: Start difference. First operand 1572 states and 2341 transitions. Second operand  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:08,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:08,006 INFO  L93              Difference]: Finished difference Result 3118 states and 4644 transitions.
[2025-02-05 19:14:08,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:08,007 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-02-05 19:14:08,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:08,011 INFO  L225             Difference]: With dead ends: 3118
[2025-02-05 19:14:08,011 INFO  L226             Difference]: Without dead ends: 1588
[2025-02-05 19:14:08,014 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:08,015 INFO  L435           NwaCegarLoop]: 1387 mSDtfsCounter, 1590 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:08,015 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 4155 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:08,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1588 states.
[2025-02-05 19:14:08,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584.
[2025-02-05 19:14:08,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1584 states, 1583 states have (on average 1.4889450410612761) internal successors, (2357), 1583 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:08,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2357 transitions.
[2025-02-05 19:14:08,038 INFO  L78                 Accepts]: Start accepts. Automaton has 1584 states and 2357 transitions. Word has length 226
[2025-02-05 19:14:08,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:08,038 INFO  L471      AbstractCegarLoop]: Abstraction has 1584 states and 2357 transitions.
[2025-02-05 19:14:08,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:08,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 1584 states and 2357 transitions.
[2025-02-05 19:14:08,040 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-02-05 19:14:08,041 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:08,041 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:08,041 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 19:14:08,041 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:08,042 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:08,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -1255804527, now seen corresponding path program 1 times
[2025-02-05 19:14:08,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:08,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150594767]
[2025-02-05 19:14:08,042 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:08,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:08,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 19:14:08,226 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 19:14:08,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:08,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:08,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:08,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:08,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150594767]
[2025-02-05 19:14:08,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150594767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:08,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:08,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:08,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773218413]
[2025-02-05 19:14:08,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:08,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:08,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:08,548 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:08,548 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:08,548 INFO  L87              Difference]: Start difference. First operand 1584 states and 2357 transitions. Second operand  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:09,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:09,056 INFO  L93              Difference]: Finished difference Result 3134 states and 4664 transitions.
[2025-02-05 19:14:09,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:09,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-02-05 19:14:09,057 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:09,061 INFO  L225             Difference]: With dead ends: 3134
[2025-02-05 19:14:09,061 INFO  L226             Difference]: Without dead ends: 1592
[2025-02-05 19:14:09,062 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:09,063 INFO  L435           NwaCegarLoop]: 1387 mSDtfsCounter, 1596 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:09,063 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:09,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1592 states.
[2025-02-05 19:14:09,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590.
[2025-02-05 19:14:09,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1590 states, 1589 states have (on average 1.488357457520453) internal successors, (2365), 1589 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:09,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2365 transitions.
[2025-02-05 19:14:09,082 INFO  L78                 Accepts]: Start accepts. Automaton has 1590 states and 2365 transitions. Word has length 226
[2025-02-05 19:14:09,082 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:09,082 INFO  L471      AbstractCegarLoop]: Abstraction has 1590 states and 2365 transitions.
[2025-02-05 19:14:09,082 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:09,082 INFO  L276                IsEmpty]: Start isEmpty. Operand 1590 states and 2365 transitions.
[2025-02-05 19:14:09,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:09,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:09,085 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:09,085 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 19:14:09,085 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:09,085 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:09,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -595000743, now seen corresponding path program 1 times
[2025-02-05 19:14:09,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:09,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034179245]
[2025-02-05 19:14:09,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:09,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:09,125 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:09,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:09,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:09,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:09,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:09,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:09,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034179245]
[2025-02-05 19:14:09,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034179245] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:09,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:09,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:09,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652185086]
[2025-02-05 19:14:09,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:09,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:09,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:09,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:09,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:09,387 INFO  L87              Difference]: Start difference. First operand 1590 states and 2365 transitions. Second operand  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:09,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:09,969 INFO  L93              Difference]: Finished difference Result 4287 states and 6370 transitions.
[2025-02-05 19:14:09,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:09,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:09,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:09,976 INFO  L225             Difference]: With dead ends: 4287
[2025-02-05 19:14:09,976 INFO  L226             Difference]: Without dead ends: 2739
[2025-02-05 19:14:09,979 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:09,980 INFO  L435           NwaCegarLoop]: 1394 mSDtfsCounter, 954 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:09,980 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:09,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2739 states.
[2025-02-05 19:14:10,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 1843.
[2025-02-05 19:14:10,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1843 states, 1842 states have (on average 1.485342019543974) internal successors, (2736), 1842 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:10,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2736 transitions.
[2025-02-05 19:14:10,015 INFO  L78                 Accepts]: Start accepts. Automaton has 1843 states and 2736 transitions. Word has length 227
[2025-02-05 19:14:10,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:10,016 INFO  L471      AbstractCegarLoop]: Abstraction has 1843 states and 2736 transitions.
[2025-02-05 19:14:10,016 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:10,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 1843 states and 2736 transitions.
[2025-02-05 19:14:10,018 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:10,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:10,019 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:10,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 19:14:10,019 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:10,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:10,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 1829699142, now seen corresponding path program 1 times
[2025-02-05 19:14:10,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:10,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177456353]
[2025-02-05 19:14:10,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:10,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:10,061 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:10,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:10,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:10,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:11,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:11,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:11,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177456353]
[2025-02-05 19:14:11,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177456353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:11,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:11,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-05 19:14:11,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572866735]
[2025-02-05 19:14:11,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:11,417 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 19:14:11,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:11,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 19:14:11,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2025-02-05 19:14:11,419 INFO  L87              Difference]: Start difference. First operand 1843 states and 2736 transitions. Second operand  has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:13,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:13,100 INFO  L93              Difference]: Finished difference Result 3615 states and 5349 transitions.
[2025-02-05 19:14:13,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-02-05 19:14:13,100 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:13,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:13,106 INFO  L225             Difference]: With dead ends: 3615
[2025-02-05 19:14:13,106 INFO  L226             Difference]: Without dead ends: 2023
[2025-02-05 19:14:13,108 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420
[2025-02-05 19:14:13,109 INFO  L435           NwaCegarLoop]: 1393 mSDtfsCounter, 1708 mSDsluCounter, 12517 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:13,109 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 13910 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2969 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 19:14:13,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2023 states.
[2025-02-05 19:14:13,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2019.
[2025-02-05 19:14:13,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2019 states, 2018 states have (on average 1.4757185332011893) internal successors, (2978), 2018 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:13,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2978 transitions.
[2025-02-05 19:14:13,134 INFO  L78                 Accepts]: Start accepts. Automaton has 2019 states and 2978 transitions. Word has length 227
[2025-02-05 19:14:13,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:13,134 INFO  L471      AbstractCegarLoop]: Abstraction has 2019 states and 2978 transitions.
[2025-02-05 19:14:13,134 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:13,134 INFO  L276                IsEmpty]: Start isEmpty. Operand 2019 states and 2978 transitions.
[2025-02-05 19:14:13,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:13,136 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:13,137 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:13,137 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 19:14:13,137 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:13,137 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:13,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 68247213, now seen corresponding path program 1 times
[2025-02-05 19:14:13,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:13,138 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468889156]
[2025-02-05 19:14:13,138 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:13,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:13,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:13,236 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:13,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:13,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:13,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:13,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:13,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468889156]
[2025-02-05 19:14:13,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468889156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:13,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:13,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:13,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740732738]
[2025-02-05 19:14:13,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:13,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:13,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:13,497 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:13,497 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:13,497 INFO  L87              Difference]: Start difference. First operand 2019 states and 2978 transitions. Second operand  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:14,100 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:14,100 INFO  L93              Difference]: Finished difference Result 3761 states and 5559 transitions.
[2025-02-05 19:14:14,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:14,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:14,101 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:14,105 INFO  L225             Difference]: With dead ends: 3761
[2025-02-05 19:14:14,105 INFO  L226             Difference]: Without dead ends: 2085
[2025-02-05 19:14:14,107 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:14,107 INFO  L435           NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:14,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:14,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2085 states.
[2025-02-05 19:14:14,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2079.
[2025-02-05 19:14:14,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2079 states, 2078 states have (on average 1.4754571703561117) internal successors, (3066), 2078 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:14,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3066 transitions.
[2025-02-05 19:14:14,126 INFO  L78                 Accepts]: Start accepts. Automaton has 2079 states and 3066 transitions. Word has length 227
[2025-02-05 19:14:14,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:14,126 INFO  L471      AbstractCegarLoop]: Abstraction has 2079 states and 3066 transitions.
[2025-02-05 19:14:14,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:14,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 2079 states and 3066 transitions.
[2025-02-05 19:14:14,128 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:14,128 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:14,129 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:14,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 19:14:14,129 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:14,129 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:14,129 INFO  L85        PathProgramCache]: Analyzing trace with hash 1550680454, now seen corresponding path program 1 times
[2025-02-05 19:14:14,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:14,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017350169]
[2025-02-05 19:14:14,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:14,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:14,172 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:14,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:14,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:14,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:14,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:14,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:14,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017350169]
[2025-02-05 19:14:14,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017350169] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:14,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:14,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-02-05 19:14:14,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151053986]
[2025-02-05 19:14:14,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:14,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-05 19:14:14,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:14,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-05 19:14:14,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-02-05 19:14:14,962 INFO  L87              Difference]: Start difference. First operand 2079 states and 3066 transitions. Second operand  has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:16,103 INFO  L93              Difference]: Finished difference Result 3835 states and 5665 transitions.
[2025-02-05 19:14:16,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-05 19:14:16,103 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:16,104 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:16,110 INFO  L225             Difference]: With dead ends: 3835
[2025-02-05 19:14:16,110 INFO  L226             Difference]: Without dead ends: 2099
[2025-02-05 19:14:16,112 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210
[2025-02-05 19:14:16,113 INFO  L435           NwaCegarLoop]: 1390 mSDtfsCounter, 1664 mSDsluCounter, 12485 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 13875 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:16,114 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 13875 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 19:14:16,116 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2025-02-05 19:14:16,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2091.
[2025-02-05 19:14:16,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2091 states, 2090 states have (on average 1.4746411483253588) internal successors, (3082), 2090 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3082 transitions.
[2025-02-05 19:14:16,139 INFO  L78                 Accepts]: Start accepts. Automaton has 2091 states and 3082 transitions. Word has length 227
[2025-02-05 19:14:16,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:16,139 INFO  L471      AbstractCegarLoop]: Abstraction has 2091 states and 3082 transitions.
[2025-02-05 19:14:16,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,141 INFO  L276                IsEmpty]: Start isEmpty. Operand 2091 states and 3082 transitions.
[2025-02-05 19:14:16,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:16,143 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:16,143 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:16,143 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 19:14:16,143 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:16,143 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:16,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 1012275708, now seen corresponding path program 1 times
[2025-02-05 19:14:16,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:16,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889364827]
[2025-02-05 19:14:16,144 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:16,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:16,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:16,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:16,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:16,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:16,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:16,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:16,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889364827]
[2025-02-05 19:14:16,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889364827] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:16,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:16,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:14:16,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121299172]
[2025-02-05 19:14:16,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:16,568 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:14:16,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:16,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:14:16,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:14:16,568 INFO  L87              Difference]: Start difference. First operand 2091 states and 3082 transitions. Second operand  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:16,956 INFO  L93              Difference]: Finished difference Result 3831 states and 5659 transitions.
[2025-02-05 19:14:16,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:16,956 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:16,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:16,960 INFO  L225             Difference]: With dead ends: 3831
[2025-02-05 19:14:16,960 INFO  L226             Difference]: Without dead ends: 2083
[2025-02-05 19:14:16,962 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 19:14:16,962 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:16,962 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:16,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2083 states.
[2025-02-05 19:14:16,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083.
[2025-02-05 19:14:16,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2083 states, 2082 states have (on average 1.4726224783861672) internal successors, (3066), 2082 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3066 transitions.
[2025-02-05 19:14:16,982 INFO  L78                 Accepts]: Start accepts. Automaton has 2083 states and 3066 transitions. Word has length 227
[2025-02-05 19:14:16,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:16,983 INFO  L471      AbstractCegarLoop]: Abstraction has 2083 states and 3066 transitions.
[2025-02-05 19:14:16,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:16,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 2083 states and 3066 transitions.
[2025-02-05 19:14:16,985 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:16,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:16,989 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:16,989 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 19:14:16,989 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:16,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:16,993 INFO  L85        PathProgramCache]: Analyzing trace with hash 866494533, now seen corresponding path program 1 times
[2025-02-05 19:14:16,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:16,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306945722]
[2025-02-05 19:14:16,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:16,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:17,039 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:17,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:17,145 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:17,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:17,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:17,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:17,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306945722]
[2025-02-05 19:14:17,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306945722] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:17,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:17,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:14:17,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656350544]
[2025-02-05 19:14:17,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:17,469 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:14:17,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:17,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:14:17,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:14:17,470 INFO  L87              Difference]: Start difference. First operand 2083 states and 3066 transitions. Second operand  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:17,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:17,828 INFO  L93              Difference]: Finished difference Result 3855 states and 5675 transitions.
[2025-02-05 19:14:17,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:17,829 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:17,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:17,832 INFO  L225             Difference]: With dead ends: 3855
[2025-02-05 19:14:17,832 INFO  L226             Difference]: Without dead ends: 2075
[2025-02-05 19:14:17,833 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 19:14:17,834 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:17,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 19:14:17,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2075 states.
[2025-02-05 19:14:17,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2075.
[2025-02-05 19:14:17,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2075 states, 2074 states have (on average 1.4705882352941178) internal successors, (3050), 2074 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:17,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3050 transitions.
[2025-02-05 19:14:17,853 INFO  L78                 Accepts]: Start accepts. Automaton has 2075 states and 3050 transitions. Word has length 227
[2025-02-05 19:14:17,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:17,854 INFO  L471      AbstractCegarLoop]: Abstraction has 2075 states and 3050 transitions.
[2025-02-05 19:14:17,854 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:17,854 INFO  L276                IsEmpty]: Start isEmpty. Operand 2075 states and 3050 transitions.
[2025-02-05 19:14:17,855 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-02-05 19:14:17,856 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:17,856 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:17,856 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 19:14:17,856 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:17,856 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:17,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 1989951914, now seen corresponding path program 1 times
[2025-02-05 19:14:17,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:17,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253978168]
[2025-02-05 19:14:17,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:17,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:17,893 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-02-05 19:14:17,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-02-05 19:14:17,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:17,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:18,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:18,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:18,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253978168]
[2025-02-05 19:14:18,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253978168] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:18,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:18,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:18,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735645032]
[2025-02-05 19:14:18,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:18,096 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:18,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:18,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:18,097 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:18,097 INFO  L87              Difference]: Start difference. First operand 2075 states and 3050 transitions. Second operand  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:18,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:18,619 INFO  L93              Difference]: Finished difference Result 4771 states and 7016 transitions.
[2025-02-05 19:14:18,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:18,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227
[2025-02-05 19:14:18,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:18,624 INFO  L225             Difference]: With dead ends: 4771
[2025-02-05 19:14:18,624 INFO  L226             Difference]: Without dead ends: 2971
[2025-02-05 19:14:18,626 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:18,627 INFO  L435           NwaCegarLoop]: 1394 mSDtfsCounter, 937 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:18,627 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:18,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2971 states.
[2025-02-05 19:14:18,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2027.
[2025-02-05 19:14:18,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2027 states, 2026 states have (on average 1.4698914116485686) internal successors, (2978), 2026 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:18,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2978 transitions.
[2025-02-05 19:14:18,647 INFO  L78                 Accepts]: Start accepts. Automaton has 2027 states and 2978 transitions. Word has length 227
[2025-02-05 19:14:18,647 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:18,648 INFO  L471      AbstractCegarLoop]: Abstraction has 2027 states and 2978 transitions.
[2025-02-05 19:14:18,648 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:18,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 2027 states and 2978 transitions.
[2025-02-05 19:14:18,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:18,649 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:18,649 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:18,650 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 19:14:18,650 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:18,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:18,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1873670103, now seen corresponding path program 1 times
[2025-02-05 19:14:18,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:18,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402333099]
[2025-02-05 19:14:18,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:18,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:18,688 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:18,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:18,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:18,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:18,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:18,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:18,939 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402333099]
[2025-02-05 19:14:18,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402333099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:18,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:18,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:18,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341849948]
[2025-02-05 19:14:18,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:18,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:18,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:18,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:18,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:18,940 INFO  L87              Difference]: Start difference. First operand 2027 states and 2978 transitions. Second operand  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:19,468 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:19,470 INFO  L93              Difference]: Finished difference Result 3799 states and 5585 transitions.
[2025-02-05 19:14:19,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:19,471 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:19,471 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:19,474 INFO  L225             Difference]: With dead ends: 3799
[2025-02-05 19:14:19,474 INFO  L226             Difference]: Without dead ends: 2035
[2025-02-05 19:14:19,476 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:19,479 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:19,481 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:19,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2035 states.
[2025-02-05 19:14:19,495 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035.
[2025-02-05 19:14:19,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2035 states, 2034 states have (on average 1.4680432645034416) internal successors, (2986), 2034 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:19,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2986 transitions.
[2025-02-05 19:14:19,499 INFO  L78                 Accepts]: Start accepts. Automaton has 2035 states and 2986 transitions. Word has length 228
[2025-02-05 19:14:19,499 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:19,499 INFO  L471      AbstractCegarLoop]: Abstraction has 2035 states and 2986 transitions.
[2025-02-05 19:14:19,499 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:19,499 INFO  L276                IsEmpty]: Start isEmpty. Operand 2035 states and 2986 transitions.
[2025-02-05 19:14:19,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:19,501 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:19,501 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:19,501 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 19:14:19,501 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:19,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:19,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -1374921350, now seen corresponding path program 1 times
[2025-02-05 19:14:19,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:19,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857194849]
[2025-02-05 19:14:19,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:19,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:19,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:19,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:19,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:19,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:20,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:20,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:20,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857194849]
[2025-02-05 19:14:20,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857194849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:20,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:20,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 19:14:20,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767107129]
[2025-02-05 19:14:20,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:20,044 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 19:14:20,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:20,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 19:14:20,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:20,045 INFO  L87              Difference]: Start difference. First operand 2035 states and 2986 transitions. Second operand  has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:20,793 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:20,793 INFO  L93              Difference]: Finished difference Result 3777 states and 5555 transitions.
[2025-02-05 19:14:20,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 19:14:20,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:20,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:20,796 INFO  L225             Difference]: With dead ends: 3777
[2025-02-05 19:14:20,796 INFO  L226             Difference]: Without dead ends: 2037
[2025-02-05 19:14:20,798 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-02-05 19:14:20,799 INFO  L435           NwaCegarLoop]: 1400 mSDtfsCounter, 1670 mSDsluCounter, 6986 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 8386 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:20,799 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 8386 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 19:14:20,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2037 states.
[2025-02-05 19:14:20,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2037.
[2025-02-05 19:14:20,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2037 states, 2036 states have (on average 1.4666011787819253) internal successors, (2986), 2036 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:20,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2986 transitions.
[2025-02-05 19:14:20,816 INFO  L78                 Accepts]: Start accepts. Automaton has 2037 states and 2986 transitions. Word has length 228
[2025-02-05 19:14:20,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:20,816 INFO  L471      AbstractCegarLoop]: Abstraction has 2037 states and 2986 transitions.
[2025-02-05 19:14:20,817 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:20,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 2037 states and 2986 transitions.
[2025-02-05 19:14:20,818 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:20,818 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:20,818 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:20,818 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-05 19:14:20,819 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:20,819 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:20,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 365110105, now seen corresponding path program 1 times
[2025-02-05 19:14:20,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:20,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176812621]
[2025-02-05 19:14:20,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:20,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:20,864 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:20,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:20,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:20,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:21,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:21,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:21,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176812621]
[2025-02-05 19:14:21,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176812621] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:21,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:21,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:21,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883452901]
[2025-02-05 19:14:21,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:21,382 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:21,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:21,382 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:21,382 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:21,382 INFO  L87              Difference]: Start difference. First operand 2037 states and 2986 transitions. Second operand  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:21,884 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:21,884 INFO  L93              Difference]: Finished difference Result 3839 states and 5641 transitions.
[2025-02-05 19:14:21,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:21,884 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:21,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:21,888 INFO  L225             Difference]: With dead ends: 3839
[2025-02-05 19:14:21,888 INFO  L226             Difference]: Without dead ends: 2097
[2025-02-05 19:14:21,890 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:21,890 INFO  L435           NwaCegarLoop]: 1402 mSDtfsCounter, 1601 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:21,890 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 5599 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:21,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2097 states.
[2025-02-05 19:14:21,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097.
[2025-02-05 19:14:21,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2097 states, 2096 states have (on average 1.4646946564885497) internal successors, (3070), 2096 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:21,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3070 transitions.
[2025-02-05 19:14:21,908 INFO  L78                 Accepts]: Start accepts. Automaton has 2097 states and 3070 transitions. Word has length 228
[2025-02-05 19:14:21,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:21,908 INFO  L471      AbstractCegarLoop]: Abstraction has 2097 states and 3070 transitions.
[2025-02-05 19:14:21,908 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:21,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 2097 states and 3070 transitions.
[2025-02-05 19:14:21,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:21,910 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:21,910 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:21,910 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-05 19:14:21,910 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:21,910 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:21,910 INFO  L85        PathProgramCache]: Analyzing trace with hash -514830370, now seen corresponding path program 1 times
[2025-02-05 19:14:21,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:21,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817375051]
[2025-02-05 19:14:21,911 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:21,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:21,951 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:22,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:22,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:22,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:22,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:22,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:22,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817375051]
[2025-02-05 19:14:22,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817375051] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:22,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:22,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 19:14:22,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338966315]
[2025-02-05 19:14:22,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:22,445 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 19:14:22,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:22,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 19:14:22,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:22,445 INFO  L87              Difference]: Start difference. First operand 2097 states and 3070 transitions. Second operand  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:23,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:23,096 INFO  L93              Difference]: Finished difference Result 3921 states and 5753 transitions.
[2025-02-05 19:14:23,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 19:14:23,096 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:23,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:23,099 INFO  L225             Difference]: With dead ends: 3921
[2025-02-05 19:14:23,099 INFO  L226             Difference]: Without dead ends: 2119
[2025-02-05 19:14:23,101 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:23,101 INFO  L435           NwaCegarLoop]: 1384 mSDtfsCounter, 1555 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 6909 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:23,101 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 6909 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:23,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2119 states.
[2025-02-05 19:14:23,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119.
[2025-02-05 19:14:23,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2119 states, 2118 states have (on average 1.4627006610009443) internal successors, (3098), 2118 states have internal predecessors, (3098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:23,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3098 transitions.
[2025-02-05 19:14:23,117 INFO  L78                 Accepts]: Start accepts. Automaton has 2119 states and 3098 transitions. Word has length 228
[2025-02-05 19:14:23,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:23,117 INFO  L471      AbstractCegarLoop]: Abstraction has 2119 states and 3098 transitions.
[2025-02-05 19:14:23,117 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:23,117 INFO  L276                IsEmpty]: Start isEmpty. Operand 2119 states and 3098 transitions.
[2025-02-05 19:14:23,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:23,118 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:23,119 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:23,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-05 19:14:23,119 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:23,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:23,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -2071373051, now seen corresponding path program 1 times
[2025-02-05 19:14:23,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:23,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17931977]
[2025-02-05 19:14:23,119 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:23,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:23,157 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:23,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:23,182 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:23,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:23,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:23,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:23,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17931977]
[2025-02-05 19:14:23,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17931977] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:23,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:23,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:23,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625054832]
[2025-02-05 19:14:23,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:23,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:23,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:23,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:23,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:23,393 INFO  L87              Difference]: Start difference. First operand 2119 states and 3098 transitions. Second operand  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:24,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:24,005 INFO  L93              Difference]: Finished difference Result 4009 states and 5875 transitions.
[2025-02-05 19:14:24,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:24,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:24,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:24,008 INFO  L225             Difference]: With dead ends: 4009
[2025-02-05 19:14:24,009 INFO  L226             Difference]: Without dead ends: 2185
[2025-02-05 19:14:24,010 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:24,010 INFO  L435           NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:24,011 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:24,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2185 states.
[2025-02-05 19:14:24,024 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2179.
[2025-02-05 19:14:24,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2179 states, 2178 states have (on average 1.462809917355372) internal successors, (3186), 2178 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:24,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3186 transitions.
[2025-02-05 19:14:24,029 INFO  L78                 Accepts]: Start accepts. Automaton has 2179 states and 3186 transitions. Word has length 228
[2025-02-05 19:14:24,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:24,029 INFO  L471      AbstractCegarLoop]: Abstraction has 2179 states and 3186 transitions.
[2025-02-05 19:14:24,029 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:24,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 2179 states and 3186 transitions.
[2025-02-05 19:14:24,031 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:24,031 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:24,031 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:24,031 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-05 19:14:24,032 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:24,032 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:24,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 245486541, now seen corresponding path program 1 times
[2025-02-05 19:14:24,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:24,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646653438]
[2025-02-05 19:14:24,033 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:24,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:24,072 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:24,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:24,148 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:24,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:24,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:24,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:24,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646653438]
[2025-02-05 19:14:24,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646653438] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:24,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:24,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 19:14:24,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507051894]
[2025-02-05 19:14:24,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:24,619 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 19:14:24,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:24,620 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 19:14:24,620 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:24,620 INFO  L87              Difference]: Start difference. First operand 2179 states and 3186 transitions. Second operand  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:25,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:25,218 INFO  L93              Difference]: Finished difference Result 4079 states and 5977 transitions.
[2025-02-05 19:14:25,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 19:14:25,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:25,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:25,220 INFO  L225             Difference]: With dead ends: 4079
[2025-02-05 19:14:25,220 INFO  L226             Difference]: Without dead ends: 2195
[2025-02-05 19:14:25,222 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:25,223 INFO  L435           NwaCegarLoop]: 1400 mSDtfsCounter, 1572 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 6988 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:25,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 6988 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:25,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2195 states.
[2025-02-05 19:14:25,237 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2193.
[2025-02-05 19:14:25,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2193 states, 2192 states have (on average 1.4607664233576643) internal successors, (3202), 2192 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:25,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3202 transitions.
[2025-02-05 19:14:25,240 INFO  L78                 Accepts]: Start accepts. Automaton has 2193 states and 3202 transitions. Word has length 228
[2025-02-05 19:14:25,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:25,241 INFO  L471      AbstractCegarLoop]: Abstraction has 2193 states and 3202 transitions.
[2025-02-05 19:14:25,241 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:25,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 2193 states and 3202 transitions.
[2025-02-05 19:14:25,242 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:25,242 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:25,243 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:25,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-05 19:14:25,243 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:25,243 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:25,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -622315692, now seen corresponding path program 1 times
[2025-02-05 19:14:25,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:25,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597786171]
[2025-02-05 19:14:25,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:25,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:25,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:25,351 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:25,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:25,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:25,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:25,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:25,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597786171]
[2025-02-05 19:14:25,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597786171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:25,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:25,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:25,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672251]
[2025-02-05 19:14:25,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:25,576 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:25,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:25,577 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:25,577 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:25,577 INFO  L87              Difference]: Start difference. First operand 2193 states and 3202 transitions. Second operand  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:26,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:26,103 INFO  L93              Difference]: Finished difference Result 4107 states and 6007 transitions.
[2025-02-05 19:14:26,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:26,104 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:26,104 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:26,106 INFO  L225             Difference]: With dead ends: 4107
[2025-02-05 19:14:26,106 INFO  L226             Difference]: Without dead ends: 2209
[2025-02-05 19:14:26,108 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:26,112 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:26,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:26,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2209 states.
[2025-02-05 19:14:26,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2209.
[2025-02-05 19:14:26,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2209 states, 2208 states have (on average 1.457427536231884) internal successors, (3218), 2208 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:26,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3218 transitions.
[2025-02-05 19:14:26,159 INFO  L78                 Accepts]: Start accepts. Automaton has 2209 states and 3218 transitions. Word has length 228
[2025-02-05 19:14:26,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:26,160 INFO  L471      AbstractCegarLoop]: Abstraction has 2209 states and 3218 transitions.
[2025-02-05 19:14:26,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:26,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 2209 states and 3218 transitions.
[2025-02-05 19:14:26,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:26,162 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:26,162 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:26,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-05 19:14:26,163 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:26,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:26,163 INFO  L85        PathProgramCache]: Analyzing trace with hash 2103886642, now seen corresponding path program 1 times
[2025-02-05 19:14:26,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:26,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645946937]
[2025-02-05 19:14:26,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:26,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:26,203 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:26,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:26,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:26,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:26,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:26,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:26,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645946937]
[2025-02-05 19:14:26,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645946937] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:26,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:26,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:26,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12574628]
[2025-02-05 19:14:26,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:26,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:26,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:26,645 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:26,645 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:26,645 INFO  L87              Difference]: Start difference. First operand 2209 states and 3218 transitions. Second operand  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:27,146 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:27,146 INFO  L93              Difference]: Finished difference Result 4217 states and 6143 transitions.
[2025-02-05 19:14:27,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:27,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:27,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:27,149 INFO  L225             Difference]: With dead ends: 4217
[2025-02-05 19:14:27,149 INFO  L226             Difference]: Without dead ends: 2281
[2025-02-05 19:14:27,150 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:27,151 INFO  L435           NwaCegarLoop]: 1402 mSDtfsCounter, 1632 mSDsluCounter, 4198 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:27,151 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 5600 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:27,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2281 states.
[2025-02-05 19:14:27,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2281.
[2025-02-05 19:14:27,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2281 states, 2280 states have (on average 1.4535087719298245) internal successors, (3314), 2280 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:27,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3314 transitions.
[2025-02-05 19:14:27,166 INFO  L78                 Accepts]: Start accepts. Automaton has 2281 states and 3314 transitions. Word has length 228
[2025-02-05 19:14:27,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:27,166 INFO  L471      AbstractCegarLoop]: Abstraction has 2281 states and 3314 transitions.
[2025-02-05 19:14:27,167 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:27,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 2281 states and 3314 transitions.
[2025-02-05 19:14:27,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:27,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:27,169 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:27,169 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-05 19:14:27,169 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:27,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:27,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 2082983023, now seen corresponding path program 1 times
[2025-02-05 19:14:27,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:27,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003920038]
[2025-02-05 19:14:27,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:27,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:27,207 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:27,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:27,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:27,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:27,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:27,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:27,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003920038]
[2025-02-05 19:14:27,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003920038] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:27,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:27,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:27,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746541286]
[2025-02-05 19:14:27,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:27,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:27,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:27,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:27,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:27,494 INFO  L87              Difference]: Start difference. First operand 2281 states and 3314 transitions. Second operand  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:28,792 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:28,793 INFO  L93              Difference]: Finished difference Result 5794 states and 8427 transitions.
[2025-02-05 19:14:28,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:28,793 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:28,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:28,796 INFO  L225             Difference]: With dead ends: 5794
[2025-02-05 19:14:28,796 INFO  L226             Difference]: Without dead ends: 3844
[2025-02-05 19:14:28,798 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:28,799 INFO  L435           NwaCegarLoop]: 1504 mSDtfsCounter, 2651 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 5681 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:28,801 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 5681 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 19:14:28,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3844 states.
[2025-02-05 19:14:28,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 2546.
[2025-02-05 19:14:28,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2546 states, 2545 states have (on average 1.4526522593320235) internal successors, (3697), 2545 states have internal predecessors, (3697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:28,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3697 transitions.
[2025-02-05 19:14:28,855 INFO  L78                 Accepts]: Start accepts. Automaton has 2546 states and 3697 transitions. Word has length 228
[2025-02-05 19:14:28,855 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:28,855 INFO  L471      AbstractCegarLoop]: Abstraction has 2546 states and 3697 transitions.
[2025-02-05 19:14:28,855 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:28,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 2546 states and 3697 transitions.
[2025-02-05 19:14:28,857 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 19:14:28,858 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:28,858 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:28,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-05 19:14:28,858 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:28,858 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:28,858 INFO  L85        PathProgramCache]: Analyzing trace with hash 372968384, now seen corresponding path program 1 times
[2025-02-05 19:14:28,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:28,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456078062]
[2025-02-05 19:14:28,859 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:28,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:28,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 19:14:28,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 19:14:28,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:28,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:29,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:29,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:29,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456078062]
[2025-02-05 19:14:29,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456078062] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:29,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:29,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:29,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422014839]
[2025-02-05 19:14:29,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:29,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:29,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:29,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:29,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:29,240 INFO  L87              Difference]: Start difference. First operand 2546 states and 3697 transitions. Second operand  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:30,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:30,498 INFO  L93              Difference]: Finished difference Result 5778 states and 8407 transitions.
[2025-02-05 19:14:30,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:30,498 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-02-05 19:14:30,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:30,501 INFO  L225             Difference]: With dead ends: 5778
[2025-02-05 19:14:30,501 INFO  L226             Difference]: Without dead ends: 3828
[2025-02-05 19:14:30,503 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:30,503 INFO  L435           NwaCegarLoop]: 1908 mSDtfsCounter, 2640 mSDsluCounter, 4985 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:30,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 6893 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 19:14:30,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3828 states.
[2025-02-05 19:14:30,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 2610.
[2025-02-05 19:14:30,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2610 states, 2609 states have (on average 1.4492142583365275) internal successors, (3781), 2609 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:30,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3781 transitions.
[2025-02-05 19:14:30,529 INFO  L78                 Accepts]: Start accepts. Automaton has 2610 states and 3781 transitions. Word has length 228
[2025-02-05 19:14:30,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:30,529 INFO  L471      AbstractCegarLoop]: Abstraction has 2610 states and 3781 transitions.
[2025-02-05 19:14:30,529 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:30,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 2610 states and 3781 transitions.
[2025-02-05 19:14:30,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-02-05 19:14:30,532 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:30,532 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:30,532 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-05 19:14:30,532 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:30,533 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:30,533 INFO  L85        PathProgramCache]: Analyzing trace with hash 563372395, now seen corresponding path program 1 times
[2025-02-05 19:14:30,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:30,533 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842397480]
[2025-02-05 19:14:30,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:30,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:30,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-02-05 19:14:30,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-02-05 19:14:30,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:30,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:30,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:30,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:30,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842397480]
[2025-02-05 19:14:30,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842397480] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:30,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:30,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:30,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854511844]
[2025-02-05 19:14:30,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:30,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:30,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:30,915 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:30,915 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:30,915 INFO  L87              Difference]: Start difference. First operand 2610 states and 3781 transitions. Second operand  has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:31,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:31,391 INFO  L93              Difference]: Finished difference Result 4592 states and 6674 transitions.
[2025-02-05 19:14:31,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:31,391 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229
[2025-02-05 19:14:31,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:31,393 INFO  L225             Difference]: With dead ends: 4592
[2025-02-05 19:14:31,393 INFO  L226             Difference]: Without dead ends: 2642
[2025-02-05 19:14:31,395 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:31,397 INFO  L435           NwaCegarLoop]: 1387 mSDtfsCounter, 1573 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:31,398 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:31,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2642 states.
[2025-02-05 19:14:31,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2634.
[2025-02-05 19:14:31,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2634 states, 2633 states have (on average 1.4481579946828713) internal successors, (3813), 2633 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:31,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3813 transitions.
[2025-02-05 19:14:31,420 INFO  L78                 Accepts]: Start accepts. Automaton has 2634 states and 3813 transitions. Word has length 229
[2025-02-05 19:14:31,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:31,420 INFO  L471      AbstractCegarLoop]: Abstraction has 2634 states and 3813 transitions.
[2025-02-05 19:14:31,420 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:31,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 2634 states and 3813 transitions.
[2025-02-05 19:14:31,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-02-05 19:14:31,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:31,422 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:31,422 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-02-05 19:14:31,423 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:31,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:31,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 660310679, now seen corresponding path program 1 times
[2025-02-05 19:14:31,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:31,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393091039]
[2025-02-05 19:14:31,423 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:31,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:31,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-02-05 19:14:31,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-02-05 19:14:31,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:31,487 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:31,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:31,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:31,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393091039]
[2025-02-05 19:14:31,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393091039] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:31,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:31,853 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 19:14:31,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597667290]
[2025-02-05 19:14:31,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:31,853 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 19:14:31,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:31,854 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 19:14:31,854 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:31,854 INFO  L87              Difference]: Start difference. First operand 2634 states and 3813 transitions. Second operand  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:32,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:32,449 INFO  L93              Difference]: Finished difference Result 4674 states and 6790 transitions.
[2025-02-05 19:14:32,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 19:14:32,451 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229
[2025-02-05 19:14:32,451 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:32,453 INFO  L225             Difference]: With dead ends: 4674
[2025-02-05 19:14:32,453 INFO  L226             Difference]: Without dead ends: 2700
[2025-02-05 19:14:32,454 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:32,455 INFO  L435           NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:32,455 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:32,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2700 states.
[2025-02-05 19:14:32,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2694.
[2025-02-05 19:14:32,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2694 states, 2693 states have (on average 1.448570367619755) internal successors, (3901), 2693 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:32,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3901 transitions.
[2025-02-05 19:14:32,475 INFO  L78                 Accepts]: Start accepts. Automaton has 2694 states and 3901 transitions. Word has length 229
[2025-02-05 19:14:32,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:32,476 INFO  L471      AbstractCegarLoop]: Abstraction has 2694 states and 3901 transitions.
[2025-02-05 19:14:32,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:32,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 2694 states and 3901 transitions.
[2025-02-05 19:14:32,478 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-02-05 19:14:32,478 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:32,479 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:32,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-02-05 19:14:32,479 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:32,479 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:32,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -1938730640, now seen corresponding path program 1 times
[2025-02-05 19:14:32,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:32,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336752270]
[2025-02-05 19:14:32,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:32,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:32,519 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-02-05 19:14:32,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-02-05 19:14:32,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:32,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:33,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:33,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:33,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336752270]
[2025-02-05 19:14:33,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336752270] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:33,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:33,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 19:14:33,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410866134]
[2025-02-05 19:14:33,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:33,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 19:14:33,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:33,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 19:14:33,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:33,106 INFO  L87              Difference]: Start difference. First operand 2694 states and 3901 transitions. Second operand  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:33,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:33,662 INFO  L93              Difference]: Finished difference Result 4750 states and 6900 transitions.
[2025-02-05 19:14:33,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 19:14:33,664 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229
[2025-02-05 19:14:33,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:33,667 INFO  L225             Difference]: With dead ends: 4750
[2025-02-05 19:14:33,667 INFO  L226             Difference]: Without dead ends: 2716
[2025-02-05 19:14:33,669 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:33,669 INFO  L435           NwaCegarLoop]: 1400 mSDtfsCounter, 1538 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6988 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:33,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6988 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:33,671 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2716 states.
[2025-02-05 19:14:33,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716.
[2025-02-05 19:14:33,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2716 states, 2715 states have (on average 1.4471454880294659) internal successors, (3929), 2715 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:33,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3929 transitions.
[2025-02-05 19:14:33,693 INFO  L78                 Accepts]: Start accepts. Automaton has 2716 states and 3929 transitions. Word has length 229
[2025-02-05 19:14:33,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:33,693 INFO  L471      AbstractCegarLoop]: Abstraction has 2716 states and 3929 transitions.
[2025-02-05 19:14:33,693 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:33,693 INFO  L276                IsEmpty]: Start isEmpty. Operand 2716 states and 3929 transitions.
[2025-02-05 19:14:33,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-02-05 19:14:33,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:33,696 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:33,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-02-05 19:14:33,696 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:33,696 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:33,697 INFO  L85        PathProgramCache]: Analyzing trace with hash 951614187, now seen corresponding path program 1 times
[2025-02-05 19:14:33,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:33,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884491562]
[2025-02-05 19:14:33,697 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:33,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:33,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-02-05 19:14:34,035 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-02-05 19:14:34,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:34,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:34,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:34,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:34,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884491562]
[2025-02-05 19:14:34,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884491562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:34,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:34,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 19:14:34,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039511377]
[2025-02-05 19:14:34,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:34,839 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 19:14:34,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:34,840 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 19:14:34,840 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-05 19:14:34,840 INFO  L87              Difference]: Start difference. First operand 2716 states and 3929 transitions. Second operand  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:35,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:35,506 INFO  L93              Difference]: Finished difference Result 4806 states and 6972 transitions.
[2025-02-05 19:14:35,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 19:14:35,506 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229
[2025-02-05 19:14:35,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:35,509 INFO  L225             Difference]: With dead ends: 4806
[2025-02-05 19:14:35,509 INFO  L226             Difference]: Without dead ends: 2750
[2025-02-05 19:14:35,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:35,511 INFO  L435           NwaCegarLoop]: 1381 mSDtfsCounter, 1523 mSDsluCounter, 5512 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:35,511 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 6893 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:35,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2750 states.
[2025-02-05 19:14:35,527 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2740.
[2025-02-05 19:14:35,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2740 states, 2739 states have (on average 1.4468784227820373) internal successors, (3963), 2739 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:35,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3963 transitions.
[2025-02-05 19:14:35,531 INFO  L78                 Accepts]: Start accepts. Automaton has 2740 states and 3963 transitions. Word has length 229
[2025-02-05 19:14:35,532 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:35,532 INFO  L471      AbstractCegarLoop]: Abstraction has 2740 states and 3963 transitions.
[2025-02-05 19:14:35,532 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:35,532 INFO  L276                IsEmpty]: Start isEmpty. Operand 2740 states and 3963 transitions.
[2025-02-05 19:14:35,534 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 19:14:35,534 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:35,534 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:35,534 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-02-05 19:14:35,535 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:35,535 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:35,535 INFO  L85        PathProgramCache]: Analyzing trace with hash 1402789056, now seen corresponding path program 1 times
[2025-02-05 19:14:35,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:35,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479310431]
[2025-02-05 19:14:35,535 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:35,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:35,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 19:14:35,768 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 19:14:35,768 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:35,768 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:36,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:36,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:36,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479310431]
[2025-02-05 19:14:36,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479310431] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:36,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:36,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 19:14:36,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628096760]
[2025-02-05 19:14:36,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:36,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 19:14:36,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:36,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 19:14:36,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:36,239 INFO  L87              Difference]: Start difference. First operand 2740 states and 3963 transitions. Second operand  has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:37,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:37,817 INFO  L93              Difference]: Finished difference Result 6207 states and 9023 transitions.
[2025-02-05 19:14:37,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-02-05 19:14:37,817 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230
[2025-02-05 19:14:37,817 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:37,820 INFO  L225             Difference]: With dead ends: 6207
[2025-02-05 19:14:37,820 INFO  L226             Difference]: Without dead ends: 2754
[2025-02-05 19:14:37,822 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272
[2025-02-05 19:14:37,823 INFO  L435           NwaCegarLoop]: 1820 mSDtfsCounter, 1466 mSDsluCounter, 12097 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 13917 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:37,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 13917 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 19:14:37,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2754 states.
[2025-02-05 19:14:37,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2750.
[2025-02-05 19:14:37,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2750 states, 2749 states have (on average 1.4459803564932703) internal successors, (3975), 2749 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:37,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3975 transitions.
[2025-02-05 19:14:37,868 INFO  L78                 Accepts]: Start accepts. Automaton has 2750 states and 3975 transitions. Word has length 230
[2025-02-05 19:14:37,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:37,869 INFO  L471      AbstractCegarLoop]: Abstraction has 2750 states and 3975 transitions.
[2025-02-05 19:14:37,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:37,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 2750 states and 3975 transitions.
[2025-02-05 19:14:37,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 19:14:37,872 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:37,873 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:37,873 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-02-05 19:14:37,873 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:37,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:37,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 660791675, now seen corresponding path program 1 times
[2025-02-05 19:14:37,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:37,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183193228]
[2025-02-05 19:14:37,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:37,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:37,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 19:14:37,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 19:14:37,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:37,961 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:38,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:38,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:38,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183193228]
[2025-02-05 19:14:38,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183193228] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:38,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:38,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:38,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978771086]
[2025-02-05 19:14:38,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:38,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:38,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:38,241 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:38,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:38,242 INFO  L87              Difference]: Start difference. First operand 2750 states and 3975 transitions. Second operand  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:38,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:38,550 INFO  L93              Difference]: Finished difference Result 4848 states and 7026 transitions.
[2025-02-05 19:14:38,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:38,550 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230
[2025-02-05 19:14:38,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:38,553 INFO  L225             Difference]: With dead ends: 4848
[2025-02-05 19:14:38,553 INFO  L226             Difference]: Without dead ends: 2758
[2025-02-05 19:14:38,554 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:38,555 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:38,555 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 19:14:38,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2758 states.
[2025-02-05 19:14:38,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758.
[2025-02-05 19:14:38,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2758 states, 2757 states have (on average 1.4446862531737397) internal successors, (3983), 2757 states have internal predecessors, (3983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:38,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 3983 transitions.
[2025-02-05 19:14:38,582 INFO  L78                 Accepts]: Start accepts. Automaton has 2758 states and 3983 transitions. Word has length 230
[2025-02-05 19:14:38,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:38,582 INFO  L471      AbstractCegarLoop]: Abstraction has 2758 states and 3983 transitions.
[2025-02-05 19:14:38,582 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:38,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 2758 states and 3983 transitions.
[2025-02-05 19:14:38,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 19:14:38,584 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:38,585 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:38,586 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-02-05 19:14:38,586 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:38,586 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:38,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987436756, now seen corresponding path program 1 times
[2025-02-05 19:14:38,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:38,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028615542]
[2025-02-05 19:14:38,586 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:38,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:38,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 19:14:38,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 19:14:38,649 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:38,649 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:38,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:38,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:38,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028615542]
[2025-02-05 19:14:38,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028615542] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:38,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:38,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:38,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527954771]
[2025-02-05 19:14:38,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:38,884 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:38,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:38,885 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:38,885 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:38,885 INFO  L87              Difference]: Start difference. First operand 2758 states and 3983 transitions. Second operand  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:39,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:39,351 INFO  L93              Difference]: Finished difference Result 4860 states and 7036 transitions.
[2025-02-05 19:14:39,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:39,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230
[2025-02-05 19:14:39,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:39,354 INFO  L225             Difference]: With dead ends: 4860
[2025-02-05 19:14:39,357 INFO  L226             Difference]: Without dead ends: 2762
[2025-02-05 19:14:39,359 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:39,359 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:39,359 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:39,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2762 states.
[2025-02-05 19:14:39,375 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762.
[2025-02-05 19:14:39,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2762 states, 2761 states have (on average 1.4440420137631294) internal successors, (3987), 2761 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:39,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3987 transitions.
[2025-02-05 19:14:39,379 INFO  L78                 Accepts]: Start accepts. Automaton has 2762 states and 3987 transitions. Word has length 230
[2025-02-05 19:14:39,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:39,379 INFO  L471      AbstractCegarLoop]: Abstraction has 2762 states and 3987 transitions.
[2025-02-05 19:14:39,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:39,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 2762 states and 3987 transitions.
[2025-02-05 19:14:39,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 19:14:39,381 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:39,381 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:39,381 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-02-05 19:14:39,382 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:39,382 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:39,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -179232592, now seen corresponding path program 1 times
[2025-02-05 19:14:39,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:39,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99512341]
[2025-02-05 19:14:39,382 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:39,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:39,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 19:14:39,550 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 19:14:39,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:39,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:39,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:39,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:39,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99512341]
[2025-02-05 19:14:39,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99512341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:39,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:39,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:39,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28431288]
[2025-02-05 19:14:39,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:39,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:39,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:39,784 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:39,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:39,784 INFO  L87              Difference]: Start difference. First operand 2762 states and 3987 transitions. Second operand  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:40,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:40,166 INFO  L93              Difference]: Finished difference Result 4872 states and 7050 transitions.
[2025-02-05 19:14:40,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:40,166 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-02-05 19:14:40,166 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:40,168 INFO  L225             Difference]: With dead ends: 4872
[2025-02-05 19:14:40,168 INFO  L226             Difference]: Without dead ends: 2770
[2025-02-05 19:14:40,169 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:40,170 INFO  L435           NwaCegarLoop]: 1387 mSDtfsCounter, 1495 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:40,170 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:40,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2770 states.
[2025-02-05 19:14:40,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2768.
[2025-02-05 19:14:40,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2768 states, 2767 states have (on average 1.4438019515720997) internal successors, (3995), 2767 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:40,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3995 transitions.
[2025-02-05 19:14:40,189 INFO  L78                 Accepts]: Start accepts. Automaton has 2768 states and 3995 transitions. Word has length 231
[2025-02-05 19:14:40,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:40,189 INFO  L471      AbstractCegarLoop]: Abstraction has 2768 states and 3995 transitions.
[2025-02-05 19:14:40,190 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:40,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 2768 states and 3995 transitions.
[2025-02-05 19:14:40,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 19:14:40,192 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:40,192 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:40,192 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-05 19:14:40,192 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:40,193 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:40,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1993826199, now seen corresponding path program 1 times
[2025-02-05 19:14:40,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:40,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458424263]
[2025-02-05 19:14:40,193 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:40,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:40,262 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 19:14:40,419 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 19:14:40,420 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:40,420 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:40,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:40,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:40,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458424263]
[2025-02-05 19:14:40,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458424263] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:40,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:40,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:40,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309854135]
[2025-02-05 19:14:40,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:40,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:40,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:40,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:40,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:40,904 INFO  L87              Difference]: Start difference. First operand 2768 states and 3995 transitions. Second operand  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:41,537 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:41,537 INFO  L93              Difference]: Finished difference Result 4882 states and 7062 transitions.
[2025-02-05 19:14:41,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:41,538 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-02-05 19:14:41,538 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:41,540 INFO  L225             Difference]: With dead ends: 4882
[2025-02-05 19:14:41,540 INFO  L226             Difference]: Without dead ends: 2774
[2025-02-05 19:14:41,541 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:41,542 INFO  L435           NwaCegarLoop]: 1226 mSDtfsCounter, 1474 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:41,543 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 3675 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 19:14:41,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2774 states.
[2025-02-05 19:14:41,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774.
[2025-02-05 19:14:41,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2774 states, 2773 states have (on average 1.442841687702849) internal successors, (4001), 2773 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:41,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4001 transitions.
[2025-02-05 19:14:41,566 INFO  L78                 Accepts]: Start accepts. Automaton has 2774 states and 4001 transitions. Word has length 231
[2025-02-05 19:14:41,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:41,566 INFO  L471      AbstractCegarLoop]: Abstraction has 2774 states and 4001 transitions.
[2025-02-05 19:14:41,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:41,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 2774 states and 4001 transitions.
[2025-02-05 19:14:41,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 19:14:41,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:41,568 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:41,568 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-02-05 19:14:41,569 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:41,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:41,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 300635868, now seen corresponding path program 1 times
[2025-02-05 19:14:41,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:41,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269358046]
[2025-02-05 19:14:41,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:41,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:41,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 19:14:41,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 19:14:41,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:41,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:42,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:42,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:42,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269358046]
[2025-02-05 19:14:42,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269358046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:42,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:42,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:42,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066739365]
[2025-02-05 19:14:42,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:42,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:42,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:42,066 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:42,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:42,066 INFO  L87              Difference]: Start difference. First operand 2774 states and 4001 transitions. Second operand  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:42,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:42,432 INFO  L93              Difference]: Finished difference Result 4894 states and 7076 transitions.
[2025-02-05 19:14:42,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:42,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-02-05 19:14:42,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:42,435 INFO  L225             Difference]: With dead ends: 4894
[2025-02-05 19:14:42,435 INFO  L226             Difference]: Without dead ends: 2780
[2025-02-05 19:14:42,436 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:42,436 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1482 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:42,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 4158 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 19:14:42,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2780 states.
[2025-02-05 19:14:42,448 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2780.
[2025-02-05 19:14:42,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2780 states, 2779 states have (on average 1.442605253688377) internal successors, (4009), 2779 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:42,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 4009 transitions.
[2025-02-05 19:14:42,452 INFO  L78                 Accepts]: Start accepts. Automaton has 2780 states and 4009 transitions. Word has length 231
[2025-02-05 19:14:42,452 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:42,452 INFO  L471      AbstractCegarLoop]: Abstraction has 2780 states and 4009 transitions.
[2025-02-05 19:14:42,452 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:42,452 INFO  L276                IsEmpty]: Start isEmpty. Operand 2780 states and 4009 transitions.
[2025-02-05 19:14:42,454 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 19:14:42,454 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:42,454 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:42,455 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-02-05 19:14:42,455 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:42,455 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:42,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1587923536, now seen corresponding path program 1 times
[2025-02-05 19:14:42,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:42,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421379777]
[2025-02-05 19:14:42,455 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:42,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:42,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 19:14:42,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 19:14:42,594 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:42,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:42,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:42,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:42,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421379777]
[2025-02-05 19:14:42,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421379777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:42,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:42,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:42,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385035355]
[2025-02-05 19:14:42,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:42,834 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:42,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:42,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:42,835 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:42,835 INFO  L87              Difference]: Start difference. First operand 2780 states and 4009 transitions. Second operand  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,231 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:43,231 INFO  L93              Difference]: Finished difference Result 4916 states and 7106 transitions.
[2025-02-05 19:14:43,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:43,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-02-05 19:14:43,232 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:43,233 INFO  L225             Difference]: With dead ends: 4916
[2025-02-05 19:14:43,233 INFO  L226             Difference]: Without dead ends: 2796
[2025-02-05 19:14:43,235 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:43,235 INFO  L435           NwaCegarLoop]: 1387 mSDtfsCounter, 1489 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:43,235 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:43,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2796 states.
[2025-02-05 19:14:43,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2792.
[2025-02-05 19:14:43,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2792 states, 2791 states have (on average 1.4421354353278395) internal successors, (4025), 2791 states have internal predecessors, (4025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4025 transitions.
[2025-02-05 19:14:43,251 INFO  L78                 Accepts]: Start accepts. Automaton has 2792 states and 4025 transitions. Word has length 231
[2025-02-05 19:14:43,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:43,251 INFO  L471      AbstractCegarLoop]: Abstraction has 2792 states and 4025 transitions.
[2025-02-05 19:14:43,251 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,251 INFO  L276                IsEmpty]: Start isEmpty. Operand 2792 states and 4025 transitions.
[2025-02-05 19:14:43,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-02-05 19:14:43,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:43,254 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:43,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-02-05 19:14:43,254 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:43,254 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:43,254 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448104913, now seen corresponding path program 1 times
[2025-02-05 19:14:43,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:43,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054762276]
[2025-02-05 19:14:43,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:43,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:43,289 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-02-05 19:14:43,312 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-02-05 19:14:43,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:43,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:43,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:43,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:43,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054762276]
[2025-02-05 19:14:43,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054762276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:43,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:43,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:43,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391945387]
[2025-02-05 19:14:43,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:43,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:43,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:43,490 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:43,490 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:43,490 INFO  L87              Difference]: Start difference. First operand 2792 states and 4025 transitions. Second operand  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:43,859 INFO  L93              Difference]: Finished difference Result 5250 states and 7553 transitions.
[2025-02-05 19:14:43,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:43,859 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-02-05 19:14:43,859 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:43,861 INFO  L225             Difference]: With dead ends: 5250
[2025-02-05 19:14:43,861 INFO  L226             Difference]: Without dead ends: 2798
[2025-02-05 19:14:43,863 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:43,863 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4211 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:43,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5619 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 19:14:43,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2798 states.
[2025-02-05 19:14:43,877 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798.
[2025-02-05 19:14:43,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2798 states, 2797 states have (on average 1.4411869860564892) internal successors, (4031), 2797 states have internal predecessors, (4031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4031 transitions.
[2025-02-05 19:14:43,881 INFO  L78                 Accepts]: Start accepts. Automaton has 2798 states and 4031 transitions. Word has length 231
[2025-02-05 19:14:43,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:43,881 INFO  L471      AbstractCegarLoop]: Abstraction has 2798 states and 4031 transitions.
[2025-02-05 19:14:43,881 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:43,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 2798 states and 4031 transitions.
[2025-02-05 19:14:43,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:43,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:43,884 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:43,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-02-05 19:14:43,884 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:43,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:43,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 639282176, now seen corresponding path program 1 times
[2025-02-05 19:14:43,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:43,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3413469]
[2025-02-05 19:14:43,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:43,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:43,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:44,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:44,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:44,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:44,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:44,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:44,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3413469]
[2025-02-05 19:14:44,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3413469] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:44,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:44,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:14:44,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631144539]
[2025-02-05 19:14:44,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:44,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:14:44,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:44,300 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:14:44,300 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:14:44,301 INFO  L87              Difference]: Start difference. First operand 2798 states and 4031 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:44,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:44,688 INFO  L93              Difference]: Finished difference Result 4930 states and 7120 transitions.
[2025-02-05 19:14:44,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:44,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:44,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:44,691 INFO  L225             Difference]: With dead ends: 4930
[2025-02-05 19:14:44,691 INFO  L226             Difference]: Without dead ends: 2796
[2025-02-05 19:14:44,692 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 19:14:44,693 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:44,693 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:44,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2796 states.
[2025-02-05 19:14:44,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2796.
[2025-02-05 19:14:44,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2796 states, 2795 states have (on average 1.4407871198568873) internal successors, (4027), 2795 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:44,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4027 transitions.
[2025-02-05 19:14:44,712 INFO  L78                 Accepts]: Start accepts. Automaton has 2796 states and 4027 transitions. Word has length 232
[2025-02-05 19:14:44,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:44,713 INFO  L471      AbstractCegarLoop]: Abstraction has 2796 states and 4027 transitions.
[2025-02-05 19:14:44,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:44,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 2796 states and 4027 transitions.
[2025-02-05 19:14:44,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:44,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:44,716 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:44,716 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-02-05 19:14:44,716 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:44,717 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:44,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -260925413, now seen corresponding path program 1 times
[2025-02-05 19:14:44,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:44,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860224351]
[2025-02-05 19:14:44,717 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:44,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:44,755 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:44,912 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:44,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:44,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:45,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:45,606 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:45,606 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860224351]
[2025-02-05 19:14:45,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860224351] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:45,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:45,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 19:14:45,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167813451]
[2025-02-05 19:14:45,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:45,607 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 19:14:45,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:45,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 19:14:45,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:45,607 INFO  L87              Difference]: Start difference. First operand 2796 states and 4027 transitions. Second operand  has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:46,894 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:46,894 INFO  L93              Difference]: Finished difference Result 4938 states and 7130 transitions.
[2025-02-05 19:14:46,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 19:14:46,895 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:46,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:46,897 INFO  L225             Difference]: With dead ends: 4938
[2025-02-05 19:14:46,897 INFO  L226             Difference]: Without dead ends: 2806
[2025-02-05 19:14:46,898 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-02-05 19:14:46,899 INFO  L435           NwaCegarLoop]: 1224 mSDtfsCounter, 1498 mSDsluCounter, 7313 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 8537 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:46,899 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 8537 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 19:14:46,900 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2806 states.
[2025-02-05 19:14:46,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2802.
[2025-02-05 19:14:46,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2802 states, 2801 states have (on average 1.4405569439485897) internal successors, (4035), 2801 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:46,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4035 transitions.
[2025-02-05 19:14:46,919 INFO  L78                 Accepts]: Start accepts. Automaton has 2802 states and 4035 transitions. Word has length 232
[2025-02-05 19:14:46,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:46,919 INFO  L471      AbstractCegarLoop]: Abstraction has 2802 states and 4035 transitions.
[2025-02-05 19:14:46,920 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:46,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 2802 states and 4035 transitions.
[2025-02-05 19:14:46,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:46,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:46,922 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:46,922 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-02-05 19:14:46,922 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:46,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:46,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554046845, now seen corresponding path program 1 times
[2025-02-05 19:14:46,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:46,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508266126]
[2025-02-05 19:14:46,922 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:46,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:46,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:47,087 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:47,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:47,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:47,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:47,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:47,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508266126]
[2025-02-05 19:14:47,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508266126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:47,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:47,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-05 19:14:47,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428673348]
[2025-02-05 19:14:47,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:47,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 19:14:47,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:47,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 19:14:47,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-02-05 19:14:47,746 INFO  L87              Difference]: Start difference. First operand 2802 states and 4035 transitions. Second operand  has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,015 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:49,015 INFO  L93              Difference]: Finished difference Result 5086 states and 7336 transitions.
[2025-02-05 19:14:49,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-05 19:14:49,016 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:49,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:49,018 INFO  L225             Difference]: With dead ends: 5086
[2025-02-05 19:14:49,018 INFO  L226             Difference]: Without dead ends: 2948
[2025-02-05 19:14:49,019 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420
[2025-02-05 19:14:49,020 INFO  L435           NwaCegarLoop]: 1393 mSDtfsCounter, 1584 mSDsluCounter, 13898 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 15291 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:49,020 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 15291 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3275 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 19:14:49,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2948 states.
[2025-02-05 19:14:49,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2944.
[2025-02-05 19:14:49,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2944 states, 2943 states have (on average 1.436969079170914) internal successors, (4229), 2943 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4229 transitions.
[2025-02-05 19:14:49,037 INFO  L78                 Accepts]: Start accepts. Automaton has 2944 states and 4229 transitions. Word has length 232
[2025-02-05 19:14:49,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:49,037 INFO  L471      AbstractCegarLoop]: Abstraction has 2944 states and 4229 transitions.
[2025-02-05 19:14:49,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 2944 states and 4229 transitions.
[2025-02-05 19:14:49,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:49,041 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:49,041 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:49,041 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-02-05 19:14:49,041 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:49,041 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:49,042 INFO  L85        PathProgramCache]: Analyzing trace with hash 1494846412, now seen corresponding path program 1 times
[2025-02-05 19:14:49,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:49,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797198700]
[2025-02-05 19:14:49,042 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:49,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:49,082 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:49,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:49,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:49,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:49,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:49,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:49,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797198700]
[2025-02-05 19:14:49,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797198700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:49,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:49,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:14:49,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422742392]
[2025-02-05 19:14:49,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:49,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:14:49,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:49,452 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:14:49,452 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:14:49,452 INFO  L87              Difference]: Start difference. First operand 2944 states and 4229 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,837 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:49,837 INFO  L93              Difference]: Finished difference Result 5216 states and 7510 transitions.
[2025-02-05 19:14:49,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:49,838 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:49,838 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:49,840 INFO  L225             Difference]: With dead ends: 5216
[2025-02-05 19:14:49,840 INFO  L226             Difference]: Without dead ends: 2936
[2025-02-05 19:14:49,842 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 19:14:49,842 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:49,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:49,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2936 states.
[2025-02-05 19:14:49,857 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2936.
[2025-02-05 19:14:49,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2936 states, 2935 states have (on average 1.435434412265758) internal successors, (4213), 2935 states have internal predecessors, (4213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4213 transitions.
[2025-02-05 19:14:49,861 INFO  L78                 Accepts]: Start accepts. Automaton has 2936 states and 4213 transitions. Word has length 232
[2025-02-05 19:14:49,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:49,861 INFO  L471      AbstractCegarLoop]: Abstraction has 2936 states and 4213 transitions.
[2025-02-05 19:14:49,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:49,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 2936 states and 4213 transitions.
[2025-02-05 19:14:49,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:49,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:49,863 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:49,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-02-05 19:14:49,863 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:49,864 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:49,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1272952682, now seen corresponding path program 1 times
[2025-02-05 19:14:49,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:49,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568802049]
[2025-02-05 19:14:49,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:49,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:49,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:49,926 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:49,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:49,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:50,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:50,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:50,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568802049]
[2025-02-05 19:14:50,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568802049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:50,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:50,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:50,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535205831]
[2025-02-05 19:14:50,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:50,150 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:50,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:50,150 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:50,150 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:50,151 INFO  L87              Difference]: Start difference. First operand 2936 states and 4213 transitions. Second operand  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:50,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:50,717 INFO  L93              Difference]: Finished difference Result 7973 states and 11442 transitions.
[2025-02-05 19:14:50,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:50,717 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:50,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:50,722 INFO  L225             Difference]: With dead ends: 7973
[2025-02-05 19:14:50,722 INFO  L226             Difference]: Without dead ends: 5701
[2025-02-05 19:14:50,724 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:50,725 INFO  L435           NwaCegarLoop]: 1394 mSDtfsCounter, 1432 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:50,725 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:50,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5701 states.
[2025-02-05 19:14:50,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 4891.
[2025-02-05 19:14:50,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4891 states, 4890 states have (on average 1.4282208588957055) internal successors, (6984), 4890 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:50,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6984 transitions.
[2025-02-05 19:14:50,791 INFO  L78                 Accepts]: Start accepts. Automaton has 4891 states and 6984 transitions. Word has length 232
[2025-02-05 19:14:50,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:50,791 INFO  L471      AbstractCegarLoop]: Abstraction has 4891 states and 6984 transitions.
[2025-02-05 19:14:50,791 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:50,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 4891 states and 6984 transitions.
[2025-02-05 19:14:50,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:50,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:50,795 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:50,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-02-05 19:14:50,795 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:50,795 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:50,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -1560275993, now seen corresponding path program 1 times
[2025-02-05 19:14:50,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:50,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231378105]
[2025-02-05 19:14:50,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:50,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:50,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:50,864 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:50,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:50,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:51,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:51,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:51,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231378105]
[2025-02-05 19:14:51,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231378105] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:51,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:51,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:51,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127168348]
[2025-02-05 19:14:51,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:51,059 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:51,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:51,060 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:51,060 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:51,060 INFO  L87              Difference]: Start difference. First operand 4891 states and 6984 transitions. Second operand  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:51,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:51,618 INFO  L93              Difference]: Finished difference Result 7959 states and 11412 transitions.
[2025-02-05 19:14:51,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 19:14:51,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:51,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:51,623 INFO  L225             Difference]: With dead ends: 7959
[2025-02-05 19:14:51,623 INFO  L226             Difference]: Without dead ends: 5623
[2025-02-05 19:14:51,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 19:14:51,626 INFO  L435           NwaCegarLoop]: 1394 mSDtfsCounter, 1424 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:51,626 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 19:14:51,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5623 states.
[2025-02-05 19:14:51,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 4843.
[2025-02-05 19:14:51,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4843 states, 4842 states have (on average 1.4275092936802973) internal successors, (6912), 4842 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:51,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 6912 transitions.
[2025-02-05 19:14:51,679 INFO  L78                 Accepts]: Start accepts. Automaton has 4843 states and 6912 transitions. Word has length 232
[2025-02-05 19:14:51,680 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:51,680 INFO  L471      AbstractCegarLoop]: Abstraction has 4843 states and 6912 transitions.
[2025-02-05 19:14:51,680 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:51,680 INFO  L276                IsEmpty]: Start isEmpty. Operand 4843 states and 6912 transitions.
[2025-02-05 19:14:51,685 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-02-05 19:14:51,685 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:51,685 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:51,685 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-02-05 19:14:51,685 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:51,686 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:51,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 1959772520, now seen corresponding path program 1 times
[2025-02-05 19:14:51,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:51,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713285323]
[2025-02-05 19:14:51,690 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:51,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:51,734 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-02-05 19:14:51,758 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-02-05 19:14:51,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:51,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:51,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:51,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:51,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713285323]
[2025-02-05 19:14:51,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713285323] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:51,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:51,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 19:14:51,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488421686]
[2025-02-05 19:14:51,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:51,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 19:14:51,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:51,984 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 19:14:51,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 19:14:51,985 INFO  L87              Difference]: Start difference. First operand 4843 states and 6912 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:52,364 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:52,364 INFO  L93              Difference]: Finished difference Result 9003 states and 12808 transitions.
[2025-02-05 19:14:52,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:52,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-02-05 19:14:52,365 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:52,368 INFO  L225             Difference]: With dead ends: 9003
[2025-02-05 19:14:52,369 INFO  L226             Difference]: Without dead ends: 4855
[2025-02-05 19:14:52,371 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 19:14:52,372 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:52,372 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:52,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4855 states.
[2025-02-05 19:14:52,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4855.
[2025-02-05 19:14:52,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4855 states, 4854 states have (on average 1.426452410383189) internal successors, (6924), 4854 states have internal predecessors, (6924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:52,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 6924 transitions.
[2025-02-05 19:14:52,408 INFO  L78                 Accepts]: Start accepts. Automaton has 4855 states and 6924 transitions. Word has length 232
[2025-02-05 19:14:52,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:52,408 INFO  L471      AbstractCegarLoop]: Abstraction has 4855 states and 6924 transitions.
[2025-02-05 19:14:52,408 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:52,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 4855 states and 6924 transitions.
[2025-02-05 19:14:52,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 19:14:52,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:52,412 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:52,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-02-05 19:14:52,412 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:52,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:52,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 756727050, now seen corresponding path program 1 times
[2025-02-05 19:14:52,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:52,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284679420]
[2025-02-05 19:14:52,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:52,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:52,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 19:14:52,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 19:14:52,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:52,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:52,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:52,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:52,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284679420]
[2025-02-05 19:14:52,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284679420] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:52,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:52,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:52,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450028905]
[2025-02-05 19:14:52,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:52,734 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:52,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:52,735 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:52,735 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:52,735 INFO  L87              Difference]: Start difference. First operand 4855 states and 6924 transitions. Second operand  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:53,121 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:53,121 INFO  L93              Difference]: Finished difference Result 9047 states and 12862 transitions.
[2025-02-05 19:14:53,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:53,122 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233
[2025-02-05 19:14:53,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:53,127 INFO  L225             Difference]: With dead ends: 9047
[2025-02-05 19:14:53,128 INFO  L226             Difference]: Without dead ends: 4867
[2025-02-05 19:14:53,131 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:53,133 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:53,133 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 19:14:53,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4867 states.
[2025-02-05 19:14:53,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867.
[2025-02-05 19:14:53,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4867 states, 4866 states have (on average 1.4254007398273736) internal successors, (6936), 4866 states have internal predecessors, (6936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:53,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6936 transitions.
[2025-02-05 19:14:53,171 INFO  L78                 Accepts]: Start accepts. Automaton has 4867 states and 6936 transitions. Word has length 233
[2025-02-05 19:14:53,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:53,171 INFO  L471      AbstractCegarLoop]: Abstraction has 4867 states and 6936 transitions.
[2025-02-05 19:14:53,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:53,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 4867 states and 6936 transitions.
[2025-02-05 19:14:53,176 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 19:14:53,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:53,176 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:53,176 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-02-05 19:14:53,176 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:53,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:53,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 156771007, now seen corresponding path program 1 times
[2025-02-05 19:14:53,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:53,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226633138]
[2025-02-05 19:14:53,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:53,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:53,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 19:14:53,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 19:14:53,474 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:53,474 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:54,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:54,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:54,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226633138]
[2025-02-05 19:14:54,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226633138] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:54,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:54,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 19:14:54,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406412621]
[2025-02-05 19:14:54,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:54,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 19:14:54,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:54,065 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 19:14:54,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-05 19:14:54,066 INFO  L87              Difference]: Start difference. First operand 4867 states and 6936 transitions. Second operand  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:54,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:54,805 INFO  L93              Difference]: Finished difference Result 7727 states and 11049 transitions.
[2025-02-05 19:14:54,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 19:14:54,805 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233
[2025-02-05 19:14:54,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:54,809 INFO  L225             Difference]: With dead ends: 7727
[2025-02-05 19:14:54,809 INFO  L226             Difference]: Without dead ends: 5055
[2025-02-05 19:14:54,811 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-02-05 19:14:54,811 INFO  L435           NwaCegarLoop]: 1395 mSDtfsCounter, 1599 mSDsluCounter, 6965 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 8360 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:54,812 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 8360 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 19:14:54,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5055 states.
[2025-02-05 19:14:54,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 5039.
[2025-02-05 19:14:54,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5039 states, 5038 states have (on average 1.4251687177451369) internal successors, (7180), 5038 states have internal predecessors, (7180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:54,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 7180 transitions.
[2025-02-05 19:14:54,842 INFO  L78                 Accepts]: Start accepts. Automaton has 5039 states and 7180 transitions. Word has length 233
[2025-02-05 19:14:54,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:54,842 INFO  L471      AbstractCegarLoop]: Abstraction has 5039 states and 7180 transitions.
[2025-02-05 19:14:54,843 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:54,843 INFO  L276                IsEmpty]: Start isEmpty. Operand 5039 states and 7180 transitions.
[2025-02-05 19:14:54,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 19:14:54,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:54,846 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:54,846 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-02-05 19:14:54,846 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:54,847 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:54,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803191581, now seen corresponding path program 1 times
[2025-02-05 19:14:54,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:54,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654173002]
[2025-02-05 19:14:54,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:54,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:54,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 19:14:54,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 19:14:54,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:54,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:55,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:55,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:55,121 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654173002]
[2025-02-05 19:14:55,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654173002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:55,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:55,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 19:14:55,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694870153]
[2025-02-05 19:14:55,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:55,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 19:14:55,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:55,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 19:14:55,122 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:55,122 INFO  L87              Difference]: Start difference. First operand 5039 states and 7180 transitions. Second operand  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:55,467 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 19:14:55,467 INFO  L93              Difference]: Finished difference Result 7487 states and 10691 transitions.
[2025-02-05 19:14:55,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 19:14:55,467 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233
[2025-02-05 19:14:55,468 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 19:14:55,471 INFO  L225             Difference]: With dead ends: 7487
[2025-02-05 19:14:55,471 INFO  L226             Difference]: Without dead ends: 5055
[2025-02-05 19:14:55,473 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 19:14:55,478 INFO  L435           NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 19:14:55,478 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 19:14:55,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5055 states.
[2025-02-05 19:14:55,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 5055.
[2025-02-05 19:14:55,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5055 states, 5054 states have (on average 1.4238227146814404) internal successors, (7196), 5054 states have internal predecessors, (7196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:55,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7196 transitions.
[2025-02-05 19:14:55,510 INFO  L78                 Accepts]: Start accepts. Automaton has 5055 states and 7196 transitions. Word has length 233
[2025-02-05 19:14:55,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 19:14:55,510 INFO  L471      AbstractCegarLoop]: Abstraction has 5055 states and 7196 transitions.
[2025-02-05 19:14:55,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 19:14:55,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 5055 states and 7196 transitions.
[2025-02-05 19:14:55,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 19:14:55,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 19:14:55,513 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 19:14:55,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-02-05 19:14:55,514 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 19:14:55,514 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 19:14:55,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 1197263123, now seen corresponding path program 1 times
[2025-02-05 19:14:55,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 19:14:55,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117511439]
[2025-02-05 19:14:55,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 19:14:55,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 19:14:55,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 19:14:55,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 19:14:55,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 19:14:55,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 19:14:56,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 19:14:56,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 19:14:56,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117511439]
[2025-02-05 19:14:56,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117511439] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 19:14:56,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 19:14:56,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-05 19:14:56,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283768555]
[2025-02-05 19:14:56,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 19:14:56,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-05 19:14:56,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 19:14:56,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-05 19:14:56,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-02-05 19:14:56,445 INFO  L87              Difference]: Start difference. First operand 5055 states and 7196 transitions. Second operand  has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)