./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label44.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0197197deedb926e3fcb07bc71f86f39dd84612d280fa340cf060f4350f6dd2
[2025-03-16 15:25:53,137 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 15:25:53,145 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 15:25:53,148 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 15:25:53,149 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 15:25:53,149 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 15:25:53,150 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label44.c
[2025-03-16 15:25:54,234 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4b1bb10/2b22d1a6f78548dbb04a6b210b1fe509/FLAG6fdf5e55f
[2025-03-16 15:25:54,616 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 15:25:54,617 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label44.c
[2025-03-16 15:25:54,636 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4b1bb10/2b22d1a6f78548dbb04a6b210b1fe509/FLAG6fdf5e55f
[2025-03-16 15:25:54,819 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4b1bb10/2b22d1a6f78548dbb04a6b210b1fe509
[2025-03-16 15:25:54,820 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 15:25:54,821 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 15:25:54,822 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 15:25:54,822 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 15:25:54,825 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 15:25:54,826 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:54" (1/1) ...
[2025-03-16 15:25:54,826 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f460129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:54, skipping insertion in model container
[2025-03-16 15:25:54,826 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:54" (1/1) ...
[2025-03-16 15:25:54,906 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 15:25:55,079 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label44.c[3592,3605]
[2025-03-16 15:25:55,452 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:25:55,458 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 15:25:55,470 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label44.c[3592,3605]
[2025-03-16 15:25:55,632 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:25:55,647 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 15:25:55,648 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55 WrapperNode
[2025-03-16 15:25:55,648 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 15:25:55,648 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 15:25:55,649 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 15:25:55,649 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 15:25:55,654 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,690 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,844 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-16 15:25:55,845 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 15:25:55,845 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 15:25:55,845 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 15:25:55,846 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 15:25:55,851 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,852 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,879 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,978 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-16 15:25:55,978 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:55,978 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,034 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,045 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,057 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,068 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,092 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 15:25:56,094 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 15:25:56,094 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 15:25:56,094 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 15:25:56,095 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (1/1) ...
[2025-03-16 15:25:56,099 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:25:56,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:25:56,118 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 15:25:56,153 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 15:25:56,171 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 15:25:56,171 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 15:25:56,172 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 15:25:56,172 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 15:25:56,221 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 15:25:56,222 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 15:25:58,723 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-16 15:25:58,723 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-16 15:25:58,811 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-16 15:25:58,811 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 15:25:58,838 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 15:25:58,838 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 15:25:58,839 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:58 BoogieIcfgContainer
[2025-03-16 15:25:58,839 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 15:25:58,844 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 15:25:58,844 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 15:25:58,849 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 15:25:58,849 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:25:54" (1/3) ...
[2025-03-16 15:25:58,849 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d98d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:58, skipping insertion in model container
[2025-03-16 15:25:58,850 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:55" (2/3) ...
[2025-03-16 15:25:58,850 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d98d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:58, skipping insertion in model container
[2025-03-16 15:25:58,850 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:58" (3/3) ...
[2025-03-16 15:25:58,851 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label44.c
[2025-03-16 15:25:58,862 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 15:25:58,863 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label44.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 15:25:58,922 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 15:25:58,931 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;@61cde534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 15:25:58,931 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 15:25:58,936 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:25:58,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-03-16 15:25:58,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:58,941 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]
[2025-03-16 15:25:58,941 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:58,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:58,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -1929874904, now seen corresponding path program 1 times
[2025-03-16 15:25:58,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:58,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813755115]
[2025-03-16 15:25:58,952 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:58,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:58,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-16 15:25:59,006 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-16 15:25:59,006 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:59,006 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:59,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:25:59,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:59,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813755115]
[2025-03-16 15:25:59,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813755115] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:59,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:59,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:59,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266620335]
[2025-03-16 15:25:59,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:59,056 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 15:25:59,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:59,069 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 15:25:59,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:25:59,073 INFO  L87              Difference]: Start difference. First operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:25:59,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:59,131 INFO  L93              Difference]: Finished difference Result 1391 states and 2763 transitions.
[2025-03-16 15:25:59,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 15:25:59,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31
[2025-03-16 15:25:59,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:59,151 INFO  L225             Difference]: With dead ends: 1391
[2025-03-16 15:25:59,151 INFO  L226             Difference]: Without dead ends: 693
[2025-03-16 15:25:59,154 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:25:59,156 INFO  L435           NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:59,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 15:25:59,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 693 states.
[2025-03-16 15:25:59,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693.
[2025-03-16 15:25:59,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:25:59,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions.
[2025-03-16 15:25:59,224 INFO  L78                 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 31
[2025-03-16 15:25:59,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:59,225 INFO  L471      AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions.
[2025-03-16 15:25:59,225 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:25:59,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions.
[2025-03-16 15:25:59,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-03-16 15:25:59,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:59,225 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]
[2025-03-16 15:25:59,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 15:25:59,226 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:59,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:59,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -678961915, now seen corresponding path program 1 times
[2025-03-16 15:25:59,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:59,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578233255]
[2025-03-16 15:25:59,226 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:59,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:59,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-16 15:25:59,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-16 15:25:59,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:59,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:59,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:25:59,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:59,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578233255]
[2025-03-16 15:25:59,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578233255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:59,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:59,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:59,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998240565]
[2025-03-16 15:25:59,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:59,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:59,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:59,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:59,378 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:25:59,378 INFO  L87              Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:01,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:01,477 INFO  L93              Difference]: Finished difference Result 2075 states and 3948 transitions.
[2025-03-16 15:26:01,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:01,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31
[2025-03-16 15:26:01,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:01,485 INFO  L225             Difference]: With dead ends: 2075
[2025-03-16 15:26:01,486 INFO  L226             Difference]: Without dead ends: 1383
[2025-03-16 15:26:01,486 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:01,487 INFO  L435           NwaCegarLoop]: 358 mSDtfsCounter, 683 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:01,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 364 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-16 15:26:01,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1383 states.
[2025-03-16 15:26:01,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383.
[2025-03-16 15:26:01,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1383 states, 1382 states have (on average 1.6519536903039074) internal successors, (2283), 1382 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:01,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2283 transitions.
[2025-03-16 15:26:01,541 INFO  L78                 Accepts]: Start accepts. Automaton has 1383 states and 2283 transitions. Word has length 31
[2025-03-16 15:26:01,541 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:01,541 INFO  L471      AbstractCegarLoop]: Abstraction has 1383 states and 2283 transitions.
[2025-03-16 15:26:01,542 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:01,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 1383 states and 2283 transitions.
[2025-03-16 15:26:01,544 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2025-03-16 15:26:01,545 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:01,545 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:01,545 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 15:26:01,545 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:01,546 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:01,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -2091072745, now seen corresponding path program 1 times
[2025-03-16 15:26:01,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:01,549 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764868769]
[2025-03-16 15:26:01,549 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:01,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:01,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-16 15:26:01,591 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-16 15:26:01,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:01,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:01,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:01,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:01,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764868769]
[2025-03-16 15:26:01,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764868769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:01,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:01,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:01,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887886747]
[2025-03-16 15:26:01,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:01,729 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:01,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:01,732 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:01,732 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:01,732 INFO  L87              Difference]: Start difference. First operand 1383 states and 2283 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:03,914 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:03,914 INFO  L93              Difference]: Finished difference Result 4145 states and 6846 transitions.
[2025-03-16 15:26:03,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:03,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2025-03-16 15:26:03,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:03,924 INFO  L225             Difference]: With dead ends: 4145
[2025-03-16 15:26:03,926 INFO  L226             Difference]: Without dead ends: 2763
[2025-03-16 15:26:03,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:03,930 INFO  L435           NwaCegarLoop]: 525 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:03,930 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 530 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-16 15:26:03,935 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2763 states.
[2025-03-16 15:26:03,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763.
[2025-03-16 15:26:03,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2763 states, 2762 states have (on average 1.4047791455467054) internal successors, (3880), 2762 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:03,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3880 transitions.
[2025-03-16 15:26:03,988 INFO  L78                 Accepts]: Start accepts. Automaton has 2763 states and 3880 transitions. Word has length 97
[2025-03-16 15:26:03,988 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:03,989 INFO  L471      AbstractCegarLoop]: Abstraction has 2763 states and 3880 transitions.
[2025-03-16 15:26:03,989 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:03,989 INFO  L276                IsEmpty]: Start isEmpty. Operand 2763 states and 3880 transitions.
[2025-03-16 15:26:03,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-16 15:26:03,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:03,991 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:03,992 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 15:26:03,992 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:03,992 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:03,993 INFO  L85        PathProgramCache]: Analyzing trace with hash -1123430125, now seen corresponding path program 1 times
[2025-03-16 15:26:03,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:03,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952958873]
[2025-03-16 15:26:03,993 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:03,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:04,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-16 15:26:04,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-16 15:26:04,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:04,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:04,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:04,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:04,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952958873]
[2025-03-16 15:26:04,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952958873] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:04,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:04,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:04,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792684056]
[2025-03-16 15:26:04,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:04,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:04,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:04,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:04,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:04,107 INFO  L87              Difference]: Start difference. First operand 2763 states and 3880 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:05,962 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:05,963 INFO  L93              Difference]: Finished difference Result 8285 states and 11637 transitions.
[2025-03-16 15:26:05,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:05,963 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98
[2025-03-16 15:26:05,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:05,977 INFO  L225             Difference]: With dead ends: 8285
[2025-03-16 15:26:05,977 INFO  L226             Difference]: Without dead ends: 5523
[2025-03-16 15:26:05,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:05,982 INFO  L435           NwaCegarLoop]: 428 mSDtfsCounter, 707 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:05,982 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 15:26:05,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5523 states.
[2025-03-16 15:26:06,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4833.
[2025-03-16 15:26:06,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4833 states, 4832 states have (on average 1.2971854304635762) internal successors, (6268), 4832 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:06,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 6268 transitions.
[2025-03-16 15:26:06,056 INFO  L78                 Accepts]: Start accepts. Automaton has 4833 states and 6268 transitions. Word has length 98
[2025-03-16 15:26:06,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:06,057 INFO  L471      AbstractCegarLoop]: Abstraction has 4833 states and 6268 transitions.
[2025-03-16 15:26:06,057 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:06,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 4833 states and 6268 transitions.
[2025-03-16 15:26:06,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-16 15:26:06,062 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:06,062 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:06,063 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 15:26:06,063 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:06,063 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:06,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 1287145630, now seen corresponding path program 1 times
[2025-03-16 15:26:06,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:06,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382633322]
[2025-03-16 15:26:06,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:06,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:06,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-16 15:26:06,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-16 15:26:06,097 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:06,097 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:06,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-03-16 15:26:06,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:06,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382633322]
[2025-03-16 15:26:06,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382633322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:06,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:06,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:06,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893211350]
[2025-03-16 15:26:06,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:06,521 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:06,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:06,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:06,522 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:06,522 INFO  L87              Difference]: Start difference. First operand 4833 states and 6268 transitions. Second operand  has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:09,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:09,044 INFO  L93              Difference]: Finished difference Result 12425 states and 15643 transitions.
[2025-03-16 15:26:09,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:09,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 218
[2025-03-16 15:26:09,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:09,060 INFO  L225             Difference]: With dead ends: 12425
[2025-03-16 15:26:09,060 INFO  L226             Difference]: Without dead ends: 7593
[2025-03-16 15:26:09,065 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:09,067 INFO  L435           NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:09,067 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 640 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-16 15:26:09,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7593 states.
[2025-03-16 15:26:09,141 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 6903.
[2025-03-16 15:26:09,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.2358736598087512) internal successors, (8530), 6902 states have internal predecessors, (8530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:09,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 8530 transitions.
[2025-03-16 15:26:09,159 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 8530 transitions. Word has length 218
[2025-03-16 15:26:09,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:09,160 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 8530 transitions.
[2025-03-16 15:26:09,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:09,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 8530 transitions.
[2025-03-16 15:26:09,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 401
[2025-03-16 15:26:09,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:09,165 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:09,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 15:26:09,165 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:09,166 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:09,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817955026, now seen corresponding path program 1 times
[2025-03-16 15:26:09,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:09,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201657340]
[2025-03-16 15:26:09,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:09,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:09,195 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes.
[2025-03-16 15:26:09,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements.
[2025-03-16 15:26:09,210 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:09,210 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:09,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 343 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-03-16 15:26:09,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:09,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201657340]
[2025-03-16 15:26:09,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201657340] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:09,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:09,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:09,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210661579]
[2025-03-16 15:26:09,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:09,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:09,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:09,555 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:09,555 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:09,556 INFO  L87              Difference]: Start difference. First operand 6903 states and 8530 transitions. Second operand  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:11,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:11,301 INFO  L93              Difference]: Finished difference Result 15238 states and 18534 transitions.
[2025-03-16 15:26:11,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:11,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 400
[2025-03-16 15:26:11,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:11,317 INFO  L225             Difference]: With dead ends: 15238
[2025-03-16 15:26:11,317 INFO  L226             Difference]: Without dead ends: 8283
[2025-03-16 15:26:11,321 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:11,321 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:11,322 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 638 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 15:26:11,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8283 states.
[2025-03-16 15:26:11,389 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283.
[2025-03-16 15:26:11,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8283 states, 8282 states have (on average 1.15431055300652) internal successors, (9560), 8282 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:11,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 9560 transitions.
[2025-03-16 15:26:11,410 INFO  L78                 Accepts]: Start accepts. Automaton has 8283 states and 9560 transitions. Word has length 400
[2025-03-16 15:26:11,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:11,410 INFO  L471      AbstractCegarLoop]: Abstraction has 8283 states and 9560 transitions.
[2025-03-16 15:26:11,411 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:11,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 8283 states and 9560 transitions.
[2025-03-16 15:26:11,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 416
[2025-03-16 15:26:11,414 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:11,414 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:11,414 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 15:26:11,414 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:11,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:11,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -792012720, now seen corresponding path program 1 times
[2025-03-16 15:26:11,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:11,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434135591]
[2025-03-16 15:26:11,415 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:11,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:11,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes.
[2025-03-16 15:26:11,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements.
[2025-03-16 15:26:11,465 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:11,465 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:11,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-16 15:26:11,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:11,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434135591]
[2025-03-16 15:26:11,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434135591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:11,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:11,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:11,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191651666]
[2025-03-16 15:26:11,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:11,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:11,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:11,679 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:11,679 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:11,682 INFO  L87              Difference]: Start difference. First operand 8283 states and 9560 transitions. Second operand  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:13,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:13,250 INFO  L93              Difference]: Finished difference Result 20015 states and 22948 transitions.
[2025-03-16 15:26:13,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:13,251 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415
[2025-03-16 15:26:13,251 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:13,272 INFO  L225             Difference]: With dead ends: 20015
[2025-03-16 15:26:13,272 INFO  L226             Difference]: Without dead ends: 11733
[2025-03-16 15:26:13,279 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:13,280 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:13,280 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 76 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 15:26:13,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11733 states.
[2025-03-16 15:26:13,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 11733.
[2025-03-16 15:26:13,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11733 states, 11732 states have (on average 1.1191612683259462) internal successors, (13130), 11732 states have internal predecessors, (13130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:13,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 13130 transitions.
[2025-03-16 15:26:13,396 INFO  L78                 Accepts]: Start accepts. Automaton has 11733 states and 13130 transitions. Word has length 415
[2025-03-16 15:26:13,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:13,397 INFO  L471      AbstractCegarLoop]: Abstraction has 11733 states and 13130 transitions.
[2025-03-16 15:26:13,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:13,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 11733 states and 13130 transitions.
[2025-03-16 15:26:13,402 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 424
[2025-03-16 15:26:13,402 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:13,402 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:13,403 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 15:26:13,403 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:13,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:13,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 211895484, now seen corresponding path program 1 times
[2025-03-16 15:26:13,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:13,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802664953]
[2025-03-16 15:26:13,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:13,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:13,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes.
[2025-03-16 15:26:13,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements.
[2025-03-16 15:26:13,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:13,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:13,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:13,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:13,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802664953]
[2025-03-16 15:26:13,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802664953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:13,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:13,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:13,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236269030]
[2025-03-16 15:26:13,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:13,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:13,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:13,845 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:13,845 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:13,845 INFO  L87              Difference]: Start difference. First operand 11733 states and 13130 transitions. Second operand  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:15,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:15,399 INFO  L93              Difference]: Finished difference Result 32435 states and 36565 transitions.
[2025-03-16 15:26:15,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:15,399 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 423
[2025-03-16 15:26:15,399 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:15,429 INFO  L225             Difference]: With dead ends: 32435
[2025-03-16 15:26:15,429 INFO  L226             Difference]: Without dead ends: 20703
[2025-03-16 15:26:15,440 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:15,441 INFO  L435           NwaCegarLoop]: 971 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:15,441 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 977 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 15:26:15,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20703 states.
[2025-03-16 15:26:15,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20013.
[2025-03-16 15:26:15,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20013 states, 20012 states have (on average 1.0955426743953627) internal successors, (21924), 20012 states have internal predecessors, (21924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:15,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 21924 transitions.
[2025-03-16 15:26:15,625 INFO  L78                 Accepts]: Start accepts. Automaton has 20013 states and 21924 transitions. Word has length 423
[2025-03-16 15:26:15,627 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:15,627 INFO  L471      AbstractCegarLoop]: Abstraction has 20013 states and 21924 transitions.
[2025-03-16 15:26:15,627 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:15,627 INFO  L276                IsEmpty]: Start isEmpty. Operand 20013 states and 21924 transitions.
[2025-03-16 15:26:15,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2025-03-16 15:26:15,631 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:15,632 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:15,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 15:26:15,632 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:15,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:15,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 962932923, now seen corresponding path program 1 times
[2025-03-16 15:26:15,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:15,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761812153]
[2025-03-16 15:26:15,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:15,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:15,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes.
[2025-03-16 15:26:15,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements.
[2025-03-16 15:26:15,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:15,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:15,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-03-16 15:26:15,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:15,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761812153]
[2025-03-16 15:26:15,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761812153] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:15,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:15,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:15,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669616487]
[2025-03-16 15:26:15,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:15,842 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:15,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:15,843 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:15,843 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:15,843 INFO  L87              Difference]: Start difference. First operand 20013 states and 21924 transitions. Second operand  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:17,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:17,349 INFO  L93              Difference]: Finished difference Result 46235 states and 50983 transitions.
[2025-03-16 15:26:17,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:17,349 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 430
[2025-03-16 15:26:17,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:17,387 INFO  L225             Difference]: With dead ends: 46235
[2025-03-16 15:26:17,388 INFO  L226             Difference]: Without dead ends: 22773
[2025-03-16 15:26:17,407 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:17,408 INFO  L435           NwaCegarLoop]: 1112 mSDtfsCounter, 672 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:17,408 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1118 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:26:17,426 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22773 states.
[2025-03-16 15:26:17,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 20703.
[2025-03-16 15:26:17,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20703 states, 20702 states have (on average 1.0554052748526712) internal successors, (21849), 20702 states have internal predecessors, (21849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:17,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 21849 transitions.
[2025-03-16 15:26:17,592 INFO  L78                 Accepts]: Start accepts. Automaton has 20703 states and 21849 transitions. Word has length 430
[2025-03-16 15:26:17,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:17,593 INFO  L471      AbstractCegarLoop]: Abstraction has 20703 states and 21849 transitions.
[2025-03-16 15:26:17,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:17,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 20703 states and 21849 transitions.
[2025-03-16 15:26:17,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 502
[2025-03-16 15:26:17,598 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:17,599 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:17,599 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 15:26:17,599 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:17,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:17,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -1386496400, now seen corresponding path program 1 times
[2025-03-16 15:26:17,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:17,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537890493]
[2025-03-16 15:26:17,603 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:17,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:17,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes.
[2025-03-16 15:26:17,651 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements.
[2025-03-16 15:26:17,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:17,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:17,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 343 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked.
[2025-03-16 15:26:17,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:17,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537890493]
[2025-03-16 15:26:17,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537890493] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:17,930 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:17,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:17,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048208202]
[2025-03-16 15:26:17,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:17,931 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:17,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:17,931 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:17,931 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:17,932 INFO  L87              Difference]: Start difference. First operand 20703 states and 21849 transitions. Second operand  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:19,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:19,170 INFO  L93              Difference]: Finished difference Result 46235 states and 49050 transitions.
[2025-03-16 15:26:19,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:19,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 501
[2025-03-16 15:26:19,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:19,198 INFO  L225             Difference]: With dead ends: 46235
[2025-03-16 15:26:19,199 INFO  L226             Difference]: Without dead ends: 23463
[2025-03-16 15:26:19,213 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:19,213 INFO  L435           NwaCegarLoop]: 928 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:19,214 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 934 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:26:19,227 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23463 states.
[2025-03-16 15:26:19,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23463 to 23463.
[2025-03-16 15:26:19,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23463 states, 23462 states have (on average 1.0528087972039895) internal successors, (24701), 23462 states have internal predecessors, (24701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:19,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23463 states to 23463 states and 24701 transitions.
[2025-03-16 15:26:19,455 INFO  L78                 Accepts]: Start accepts. Automaton has 23463 states and 24701 transitions. Word has length 501
[2025-03-16 15:26:19,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:19,456 INFO  L471      AbstractCegarLoop]: Abstraction has 23463 states and 24701 transitions.
[2025-03-16 15:26:19,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:19,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 23463 states and 24701 transitions.
[2025-03-16 15:26:19,462 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 665
[2025-03-16 15:26:19,462 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:19,463 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:19,464 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 15:26:19,464 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:19,464 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:19,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1557876710, now seen corresponding path program 1 times
[2025-03-16 15:26:19,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:19,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45294026]
[2025-03-16 15:26:19,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:19,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:19,497 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes.
[2025-03-16 15:26:19,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements.
[2025-03-16 15:26:19,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:19,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:19,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 507 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-03-16 15:26:19,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:19,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45294026]
[2025-03-16 15:26:19,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45294026] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:19,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:19,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:19,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097639989]
[2025-03-16 15:26:19,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:19,697 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:19,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:19,697 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:19,697 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:19,697 INFO  L87              Difference]: Start difference. First operand 23463 states and 24701 transitions. Second operand  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:21,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:21,055 INFO  L93              Difference]: Finished difference Result 46925 states and 49401 transitions.
[2025-03-16 15:26:21,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:21,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 664
[2025-03-16 15:26:21,056 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:21,090 INFO  L225             Difference]: With dead ends: 46925
[2025-03-16 15:26:21,090 INFO  L226             Difference]: Without dead ends: 23463
[2025-03-16 15:26:21,107 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:21,107 INFO  L435           NwaCegarLoop]: 738 mSDtfsCounter, 765 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:21,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 744 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:21,143 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23463 states.
[2025-03-16 15:26:21,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23463 to 23463.
[2025-03-16 15:26:21,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23463 states, 23462 states have (on average 1.0465859688006138) internal successors, (24555), 23462 states have internal predecessors, (24555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:21,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23463 states to 23463 states and 24555 transitions.
[2025-03-16 15:26:21,314 INFO  L78                 Accepts]: Start accepts. Automaton has 23463 states and 24555 transitions. Word has length 664
[2025-03-16 15:26:21,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:21,314 INFO  L471      AbstractCegarLoop]: Abstraction has 23463 states and 24555 transitions.
[2025-03-16 15:26:21,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:21,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 23463 states and 24555 transitions.
[2025-03-16 15:26:21,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 708
[2025-03-16 15:26:21,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:21,322 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:21,322 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 15:26:21,322 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:21,322 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:21,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -1876834497, now seen corresponding path program 1 times
[2025-03-16 15:26:21,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:21,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878199469]
[2025-03-16 15:26:21,322 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:21,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:21,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes.
[2025-03-16 15:26:21,374 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements.
[2025-03-16 15:26:21,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:21,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:21,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 990 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked.
[2025-03-16 15:26:21,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:21,656 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878199469]
[2025-03-16 15:26:21,656 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878199469] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:21,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:21,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:21,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837973804]
[2025-03-16 15:26:21,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:21,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:21,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:21,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:21,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:21,658 INFO  L87              Difference]: Start difference. First operand 23463 states and 24555 transitions. Second operand  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:22,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:22,366 INFO  L93              Difference]: Finished difference Result 46947 states and 49131 transitions.
[2025-03-16 15:26:22,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:22,366 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 707
[2025-03-16 15:26:22,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:22,386 INFO  L225             Difference]: With dead ends: 46947
[2025-03-16 15:26:22,386 INFO  L226             Difference]: Without dead ends: 23463
[2025-03-16 15:26:22,408 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:22,408 INFO  L435           NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:22,409 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 984 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 15:26:22,422 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23463 states.
[2025-03-16 15:26:22,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23463 to 23463.
[2025-03-16 15:26:22,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23463 states, 23462 states have (on average 1.0464154803512062) internal successors, (24551), 23462 states have internal predecessors, (24551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:22,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23463 states to 23463 states and 24551 transitions.
[2025-03-16 15:26:22,569 INFO  L78                 Accepts]: Start accepts. Automaton has 23463 states and 24551 transitions. Word has length 707
[2025-03-16 15:26:22,570 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:22,570 INFO  L471      AbstractCegarLoop]: Abstraction has 23463 states and 24551 transitions.
[2025-03-16 15:26:22,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:22,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 23463 states and 24551 transitions.
[2025-03-16 15:26:22,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 721
[2025-03-16 15:26:22,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:22,577 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:22,577 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 15:26:22,577 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:22,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:22,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -1923653196, now seen corresponding path program 1 times
[2025-03-16 15:26:22,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:22,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089032013]
[2025-03-16 15:26:22,578 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:22,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:22,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 720 statements into 1 equivalence classes.
[2025-03-16 15:26:22,625 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 720 of 720 statements.
[2025-03-16 15:26:22,626 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:22,626 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:23,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 785 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-16 15:26:23,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:23,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089032013]
[2025-03-16 15:26:23,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089032013] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:23,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:23,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:23,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743925191]
[2025-03-16 15:26:23,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:23,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:23,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:23,241 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:23,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:23,241 INFO  L87              Difference]: Start difference. First operand 23463 states and 24551 transitions. Second operand  has 4 states, 4 states have (on average 152.0) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:25,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:25,158 INFO  L93              Difference]: Finished difference Result 53825 states and 56581 transitions.
[2025-03-16 15:26:25,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:25,162 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 152.0) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 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 720
[2025-03-16 15:26:25,162 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:25,186 INFO  L225             Difference]: With dead ends: 53825
[2025-03-16 15:26:25,186 INFO  L226             Difference]: Without dead ends: 30363
[2025-03-16 15:26:25,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:25,193 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 1009 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:25,193 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 89 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 15:26:25,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30363 states.
[2025-03-16 15:26:25,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 29673.
[2025-03-16 15:26:25,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29673 states, 29672 states have (on average 1.0441493664060393) internal successors, (30982), 29672 states have internal predecessors, (30982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:25,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29673 states to 29673 states and 30982 transitions.
[2025-03-16 15:26:25,401 INFO  L78                 Accepts]: Start accepts. Automaton has 29673 states and 30982 transitions. Word has length 720
[2025-03-16 15:26:25,401 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:25,401 INFO  L471      AbstractCegarLoop]: Abstraction has 29673 states and 30982 transitions.
[2025-03-16 15:26:25,401 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 152.0) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:25,401 INFO  L276                IsEmpty]: Start isEmpty. Operand 29673 states and 30982 transitions.
[2025-03-16 15:26:25,413 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1264
[2025-03-16 15:26:25,413 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:25,413 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:25,414 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 15:26:25,414 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:25,414 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:25,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 170021389, now seen corresponding path program 1 times
[2025-03-16 15:26:25,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:25,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238810249]
[2025-03-16 15:26:25,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:25,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:25,474 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1263 statements into 1 equivalence classes.
[2025-03-16 15:26:25,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1263 of 1263 statements.
[2025-03-16 15:26:25,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:25,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:26,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 1534 backedges. 319 proven. 1129 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-16 15:26:26,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:26,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238810249]
[2025-03-16 15:26:26,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238810249] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:26,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712997322]
[2025-03-16 15:26:26,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:26,761 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:26,761 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:26,765 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 15:26:26,766 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 15:26:26,860 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1263 statements into 1 equivalence classes.
[2025-03-16 15:26:27,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1263 of 1263 statements.
[2025-03-16 15:26:27,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:27,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:27,015 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:27,037 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:27,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 1534 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked.
[2025-03-16 15:26:27,170 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:27,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [712997322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:27,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:27,171 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10
[2025-03-16 15:26:27,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790358269]
[2025-03-16 15:26:27,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:27,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:27,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:27,172 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:27,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-16 15:26:27,172 INFO  L87              Difference]: Start difference. First operand 29673 states and 30982 transitions. Second operand  has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:28,424 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:28,425 INFO  L93              Difference]: Finished difference Result 59345 states and 61970 transitions.
[2025-03-16 15:26:28,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:28,425 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 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 1263
[2025-03-16 15:26:28,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:28,455 INFO  L225             Difference]: With dead ends: 59345
[2025-03-16 15:26:28,455 INFO  L226             Difference]: Without dead ends: 29673
[2025-03-16 15:26:28,470 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1263 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-16 15:26:28,471 INFO  L435           NwaCegarLoop]: 797 mSDtfsCounter, 642 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:28,471 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 802 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:26:28,485 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29673 states.
[2025-03-16 15:26:28,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29673 to 29673.
[2025-03-16 15:26:28,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29673 states, 29672 states have (on average 1.0401388514424372) internal successors, (30863), 29672 states have internal predecessors, (30863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:28,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29673 states to 29673 states and 30863 transitions.
[2025-03-16 15:26:28,770 INFO  L78                 Accepts]: Start accepts. Automaton has 29673 states and 30863 transitions. Word has length 1263
[2025-03-16 15:26:28,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:28,771 INFO  L471      AbstractCegarLoop]: Abstraction has 29673 states and 30863 transitions.
[2025-03-16 15:26:28,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:28,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 29673 states and 30863 transitions.
[2025-03-16 15:26:28,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1296
[2025-03-16 15:26:28,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:28,794 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:28,802 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-16 15:26:28,995 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-16 15:26:28,995 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:28,996 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:28,996 INFO  L85        PathProgramCache]: Analyzing trace with hash -1336193972, now seen corresponding path program 1 times
[2025-03-16 15:26:28,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:28,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273592475]
[2025-03-16 15:26:28,996 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:28,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:29,091 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1295 statements into 1 equivalence classes.
[2025-03-16 15:26:29,146 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1295 of 1295 statements.
[2025-03-16 15:26:29,146 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:29,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:30,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 2197 backedges. 1372 proven. 614 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked.
[2025-03-16 15:26:30,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:30,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273592475]
[2025-03-16 15:26:30,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273592475] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:30,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535078467]
[2025-03-16 15:26:30,284 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:30,284 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:30,285 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:30,286 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 15:26:30,288 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 15:26:30,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1295 statements into 1 equivalence classes.
[2025-03-16 15:26:30,540 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1295 of 1295 statements.
[2025-03-16 15:26:30,540 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:30,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:30,545 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:30,554 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:30,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 2197 backedges. 1384 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked.
[2025-03-16 15:26:30,682 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:30,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [535078467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:30,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:30,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-16 15:26:30,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831974336]
[2025-03-16 15:26:30,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:30,684 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:30,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:30,685 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:30,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 15:26:30,685 INFO  L87              Difference]: Start difference. First operand 29673 states and 30863 transitions. Second operand  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:31,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:31,944 INFO  L93              Difference]: Finished difference Result 69005 states and 72130 transitions.
[2025-03-16 15:26:31,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:31,945 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 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 1295
[2025-03-16 15:26:31,945 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:31,979 INFO  L225             Difference]: With dead ends: 69005
[2025-03-16 15:26:31,980 INFO  L226             Difference]: Without dead ends: 40023
[2025-03-16 15:26:31,999 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1302 GetRequests, 1295 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 15:26:31,999 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 631 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:31,999 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 147 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:26:32,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40023 states.
[2025-03-16 15:26:32,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40023 to 39333.
[2025-03-16 15:26:32,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39333 states, 39332 states have (on average 1.0384165564934404) internal successors, (40843), 39332 states have internal predecessors, (40843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:32,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39333 states to 39333 states and 40843 transitions.
[2025-03-16 15:26:32,267 INFO  L78                 Accepts]: Start accepts. Automaton has 39333 states and 40843 transitions. Word has length 1295
[2025-03-16 15:26:32,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:32,267 INFO  L471      AbstractCegarLoop]: Abstraction has 39333 states and 40843 transitions.
[2025-03-16 15:26:32,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:32,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 39333 states and 40843 transitions.
[2025-03-16 15:26:32,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1356
[2025-03-16 15:26:32,281 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:32,282 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:32,288 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-16 15:26:32,483 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-16 15:26:32,483 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:32,484 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:32,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 823710988, now seen corresponding path program 1 times
[2025-03-16 15:26:32,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:32,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81760036]
[2025-03-16 15:26:32,484 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:32,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:32,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes.
[2025-03-16 15:26:32,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements.
[2025-03-16 15:26:32,572 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:32,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:33,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 2687 backedges. 1534 proven. 0 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked.
[2025-03-16 15:26:33,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:33,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81760036]
[2025-03-16 15:26:33,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81760036] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:33,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:33,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:33,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244364151]
[2025-03-16 15:26:33,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:33,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:33,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:33,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:33,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:33,433 INFO  L87              Difference]: Start difference. First operand 39333 states and 40843 transitions. Second operand  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:34,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:34,618 INFO  L93              Difference]: Finished difference Result 77975 states and 80994 transitions.
[2025-03-16 15:26:34,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:34,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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 1355
[2025-03-16 15:26:34,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:34,656 INFO  L225             Difference]: With dead ends: 77975
[2025-03-16 15:26:34,656 INFO  L226             Difference]: Without dead ends: 39333
[2025-03-16 15:26:34,677 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:34,678 INFO  L435           NwaCegarLoop]: 751 mSDtfsCounter, 658 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:34,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 756 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:26:34,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39333 states.
[2025-03-16 15:26:34,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39333 to 39333.
[2025-03-16 15:26:34,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39333 states, 39332 states have (on average 1.0367893826909387) internal successors, (40779), 39332 states have internal predecessors, (40779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:35,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39333 states to 39333 states and 40779 transitions.
[2025-03-16 15:26:35,002 INFO  L78                 Accepts]: Start accepts. Automaton has 39333 states and 40779 transitions. Word has length 1355
[2025-03-16 15:26:35,003 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:35,003 INFO  L471      AbstractCegarLoop]: Abstraction has 39333 states and 40779 transitions.
[2025-03-16 15:26:35,003 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:35,003 INFO  L276                IsEmpty]: Start isEmpty. Operand 39333 states and 40779 transitions.
[2025-03-16 15:26:35,022 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1367
[2025-03-16 15:26:35,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:35,022 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:35,022 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 15:26:35,023 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:35,023 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:35,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951297844, now seen corresponding path program 1 times
[2025-03-16 15:26:35,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:35,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922320809]
[2025-03-16 15:26:35,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:35,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:35,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes.
[2025-03-16 15:26:35,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements.
[2025-03-16 15:26:35,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:35,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:35,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 2332 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked.
[2025-03-16 15:26:35,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:35,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922320809]
[2025-03-16 15:26:35,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922320809] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:35,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:35,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:35,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909869588]
[2025-03-16 15:26:35,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:35,893 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:35,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:35,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:35,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:35,894 INFO  L87              Difference]: Start difference. First operand 39333 states and 40779 transitions. Second operand  has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:37,339 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:37,339 INFO  L93              Difference]: Finished difference Result 85565 states and 89073 transitions.
[2025-03-16 15:26:37,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:37,343 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 1366
[2025-03-16 15:26:37,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:37,387 INFO  L225             Difference]: With dead ends: 85565
[2025-03-16 15:26:37,387 INFO  L226             Difference]: Without dead ends: 46923
[2025-03-16 15:26:37,411 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:37,412 INFO  L435           NwaCegarLoop]: 262 mSDtfsCounter, 610 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:37,412 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 268 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:26:37,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46923 states.
[2025-03-16 15:26:37,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46923 to 40023.
[2025-03-16 15:26:37,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40023 states, 40022 states have (on average 1.0364049772625057) internal successors, (41479), 40022 states have internal predecessors, (41479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:37,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40023 states to 40023 states and 41479 transitions.
[2025-03-16 15:26:37,716 INFO  L78                 Accepts]: Start accepts. Automaton has 40023 states and 41479 transitions. Word has length 1366
[2025-03-16 15:26:37,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:37,716 INFO  L471      AbstractCegarLoop]: Abstraction has 40023 states and 41479 transitions.
[2025-03-16 15:26:37,717 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:37,717 INFO  L276                IsEmpty]: Start isEmpty. Operand 40023 states and 41479 transitions.
[2025-03-16 15:26:37,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1398
[2025-03-16 15:26:37,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:37,733 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:37,733 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 15:26:37,733 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:37,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:37,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 1117673397, now seen corresponding path program 1 times
[2025-03-16 15:26:37,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:37,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117212627]
[2025-03-16 15:26:37,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:37,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:37,787 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1397 statements into 1 equivalence classes.
[2025-03-16 15:26:37,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1397 of 1397 statements.
[2025-03-16 15:26:37,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:37,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:38,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 2135 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked.
[2025-03-16 15:26:38,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:38,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117212627]
[2025-03-16 15:26:38,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117212627] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:38,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:38,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:38,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685527089]
[2025-03-16 15:26:38,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:38,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:38,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:38,317 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:38,317 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:38,317 INFO  L87              Difference]: Start difference. First operand 40023 states and 41479 transitions. Second operand  has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:39,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:39,655 INFO  L93              Difference]: Finished difference Result 91085 states and 94711 transitions.
[2025-03-16 15:26:39,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:39,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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 1397
[2025-03-16 15:26:39,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:39,704 INFO  L225             Difference]: With dead ends: 91085
[2025-03-16 15:26:39,704 INFO  L226             Difference]: Without dead ends: 51063
[2025-03-16 15:26:39,729 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:39,729 INFO  L435           NwaCegarLoop]: 959 mSDtfsCounter, 662 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:39,730 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 965 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:39,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51063 states.
[2025-03-16 15:26:40,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51063 to 49683.
[2025-03-16 15:26:40,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49683 states, 49682 states have (on average 1.034821464514311) internal successors, (51412), 49682 states have internal predecessors, (51412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:40,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49683 states to 49683 states and 51412 transitions.
[2025-03-16 15:26:40,090 INFO  L78                 Accepts]: Start accepts. Automaton has 49683 states and 51412 transitions. Word has length 1397
[2025-03-16 15:26:40,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:40,090 INFO  L471      AbstractCegarLoop]: Abstraction has 49683 states and 51412 transitions.
[2025-03-16 15:26:40,090 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:40,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 49683 states and 51412 transitions.
[2025-03-16 15:26:40,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1557
[2025-03-16 15:26:40,112 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:40,113 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:40,113 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 15:26:40,113 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:40,114 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:40,114 INFO  L85        PathProgramCache]: Analyzing trace with hash 1138127539, now seen corresponding path program 1 times
[2025-03-16 15:26:40,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:40,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743163487]
[2025-03-16 15:26:40,114 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:40,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:40,177 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1556 statements into 1 equivalence classes.
[2025-03-16 15:26:40,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1556 of 1556 statements.
[2025-03-16 15:26:40,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:40,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:40,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 2293 backedges. 1188 proven. 0 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked.
[2025-03-16 15:26:40,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:40,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743163487]
[2025-03-16 15:26:40,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743163487] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:40,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:40,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:40,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236818055]
[2025-03-16 15:26:40,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:40,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:40,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:40,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:40,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:40,641 INFO  L87              Difference]: Start difference. First operand 49683 states and 51412 transitions. Second operand  has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:42,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:42,032 INFO  L93              Difference]: Finished difference Result 117995 states and 122439 transitions.
[2025-03-16 15:26:42,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:42,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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 1556
[2025-03-16 15:26:42,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:42,097 INFO  L225             Difference]: With dead ends: 117995
[2025-03-16 15:26:42,097 INFO  L226             Difference]: Without dead ends: 69003
[2025-03-16 15:26:42,132 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:42,132 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 301 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:42,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 81 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:42,175 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69003 states.
[2025-03-16 15:26:42,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69003 to 69003.
[2025-03-16 15:26:42,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69003 states, 69002 states have (on average 1.0360279412190951) internal successors, (71488), 69002 states have internal predecessors, (71488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:42,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69003 states to 69003 states and 71488 transitions.
[2025-03-16 15:26:42,693 INFO  L78                 Accepts]: Start accepts. Automaton has 69003 states and 71488 transitions. Word has length 1556
[2025-03-16 15:26:42,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:42,694 INFO  L471      AbstractCegarLoop]: Abstraction has 69003 states and 71488 transitions.
[2025-03-16 15:26:42,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:42,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 69003 states and 71488 transitions.
[2025-03-16 15:26:42,734 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1796
[2025-03-16 15:26:42,734 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:42,734 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:42,735 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-16 15:26:42,735 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:42,735 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:42,736 INFO  L85        PathProgramCache]: Analyzing trace with hash -343932945, now seen corresponding path program 1 times
[2025-03-16 15:26:42,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:42,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858866099]
[2025-03-16 15:26:42,736 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:42,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:42,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1795 statements into 1 equivalence classes.
[2025-03-16 15:26:42,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1795 of 1795 statements.
[2025-03-16 15:26:42,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:42,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:43,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 3130 backedges. 2094 proven. 0 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked.
[2025-03-16 15:26:43,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:43,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858866099]
[2025-03-16 15:26:43,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858866099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:43,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:43,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:43,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115955925]
[2025-03-16 15:26:43,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:43,579 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:43,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:43,579 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:43,579 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:43,583 INFO  L87              Difference]: Start difference. First operand 69003 states and 71488 transitions. Second operand  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:44,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:44,985 INFO  L93              Difference]: Finished difference Result 149735 states and 155585 transitions.
[2025-03-16 15:26:44,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:44,985 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 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 1795
[2025-03-16 15:26:44,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:45,205 INFO  L225             Difference]: With dead ends: 149735
[2025-03-16 15:26:45,205 INFO  L226             Difference]: Without dead ends: 81423
[2025-03-16 15:26:45,225 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:45,226 INFO  L435           NwaCegarLoop]: 930 mSDtfsCounter, 493 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:45,226 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 935 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:26:45,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81423 states.
[2025-03-16 15:26:45,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81423 to 80043.
[2025-03-16 15:26:45,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80043 states, 80042 states have (on average 1.0345943379725644) internal successors, (82811), 80042 states have internal predecessors, (82811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:46,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80043 states to 80043 states and 82811 transitions.
[2025-03-16 15:26:46,059 INFO  L78                 Accepts]: Start accepts. Automaton has 80043 states and 82811 transitions. Word has length 1795
[2025-03-16 15:26:46,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:46,059 INFO  L471      AbstractCegarLoop]: Abstraction has 80043 states and 82811 transitions.
[2025-03-16 15:26:46,060 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:46,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 80043 states and 82811 transitions.
[2025-03-16 15:26:46,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1842
[2025-03-16 15:26:46,113 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:46,114 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:46,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-16 15:26:46,114 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:46,115 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:46,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1535360931, now seen corresponding path program 1 times
[2025-03-16 15:26:46,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:46,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414865019]
[2025-03-16 15:26:46,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:46,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:46,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1841 statements into 1 equivalence classes.
[2025-03-16 15:26:46,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1841 of 1841 statements.
[2025-03-16 15:26:46,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:46,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:48,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 3095 backedges. 1043 proven. 1287 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked.
[2025-03-16 15:26:48,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:48,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414865019]
[2025-03-16 15:26:48,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414865019] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:48,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054014390]
[2025-03-16 15:26:48,084 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:48,084 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:48,085 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:48,087 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 15:26:48,089 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 15:26:48,268 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1841 statements into 1 equivalence classes.
[2025-03-16 15:26:48,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1841 of 1841 statements.
[2025-03-16 15:26:48,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:48,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:48,508 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:48,521 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:48,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 3095 backedges. 1475 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked.
[2025-03-16 15:26:48,912 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:48,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054014390] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:48,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:48,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-16 15:26:48,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862215605]
[2025-03-16 15:26:48,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:48,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:48,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:48,914 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:48,914 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-16 15:26:48,914 INFO  L87              Difference]: Start difference. First operand 80043 states and 82811 transitions. Second operand  has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:50,255 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:50,256 INFO  L93              Difference]: Finished difference Result 159395 states and 164930 transitions.
[2025-03-16 15:26:50,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:50,256 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 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 1841
[2025-03-16 15:26:50,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:50,442 INFO  L225             Difference]: With dead ends: 159395
[2025-03-16 15:26:50,442 INFO  L226             Difference]: Without dead ends: 80043
[2025-03-16 15:26:50,471 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1846 GetRequests, 1841 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-16 15:26:50,472 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:50,472 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 135 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:26:50,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80043 states.
[2025-03-16 15:26:50,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80043 to 79353.
[2025-03-16 15:26:51,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79353 states, 79352 states have (on average 1.0235910878112713) internal successors, (81224), 79352 states have internal predecessors, (81224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:51,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79353 states to 79353 states and 81224 transitions.
[2025-03-16 15:26:51,095 INFO  L78                 Accepts]: Start accepts. Automaton has 79353 states and 81224 transitions. Word has length 1841
[2025-03-16 15:26:51,096 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:51,096 INFO  L471      AbstractCegarLoop]: Abstraction has 79353 states and 81224 transitions.
[2025-03-16 15:26:51,096 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:51,096 INFO  L276                IsEmpty]: Start isEmpty. Operand 79353 states and 81224 transitions.
[2025-03-16 15:26:51,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2012
[2025-03-16 15:26:51,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:51,271 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:51,279 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-16 15:26:51,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:51,472 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:51,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:51,473 INFO  L85        PathProgramCache]: Analyzing trace with hash -984884034, now seen corresponding path program 1 times
[2025-03-16 15:26:51,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:51,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400514699]
[2025-03-16 15:26:51,473 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:51,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:51,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2011 statements into 1 equivalence classes.
[2025-03-16 15:26:51,604 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2011 of 2011 statements.
[2025-03-16 15:26:51,605 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:51,606 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:52,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 3223 backedges. 2232 proven. 0 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2025-03-16 15:26:52,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:52,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400514699]
[2025-03-16 15:26:52,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400514699] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:52,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:52,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:52,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152477670]
[2025-03-16 15:26:52,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:52,772 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:52,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:52,773 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:52,773 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:52,773 INFO  L87              Difference]: Start difference. First operand 79353 states and 81224 transitions. Second operand  has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:54,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:54,341 INFO  L93              Difference]: Finished difference Result 177335 states and 181627 transitions.
[2025-03-16 15:26:54,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:54,342 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 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 2011
[2025-03-16 15:26:54,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:54,439 INFO  L225             Difference]: With dead ends: 177335
[2025-03-16 15:26:54,439 INFO  L226             Difference]: Without dead ends: 98673
[2025-03-16 15:26:54,491 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:54,495 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 615 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:54,495 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 205 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:54,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98673 states.
[2025-03-16 15:26:55,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98673 to 98673.
[2025-03-16 15:26:55,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98673 states, 98672 states have (on average 1.0226508026593157) internal successors, (100907), 98672 states have internal predecessors, (100907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:55,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98673 states to 98673 states and 100907 transitions.
[2025-03-16 15:26:55,594 INFO  L78                 Accepts]: Start accepts. Automaton has 98673 states and 100907 transitions. Word has length 2011
[2025-03-16 15:26:55,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:55,595 INFO  L471      AbstractCegarLoop]: Abstraction has 98673 states and 100907 transitions.
[2025-03-16 15:26:55,595 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:55,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 98673 states and 100907 transitions.
[2025-03-16 15:26:55,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2313
[2025-03-16 15:26:55,665 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:55,665 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:55,665 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-16 15:26:55,665 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:55,666 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:55,666 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821705149, now seen corresponding path program 1 times
[2025-03-16 15:26:55,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:55,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888771486]
[2025-03-16 15:26:55,667 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:55,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:55,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2312 statements into 1 equivalence classes.
[2025-03-16 15:26:55,949 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2312 of 2312 statements.
[2025-03-16 15:26:55,949 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:55,949 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:58,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 4724 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked.
[2025-03-16 15:26:58,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:58,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888771486]
[2025-03-16 15:26:58,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888771486] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:58,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:58,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:58,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003020571]
[2025-03-16 15:26:58,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:58,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:58,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:58,452 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:58,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:58,453 INFO  L87              Difference]: Start difference. First operand 98673 states and 100907 transitions. Second operand  has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:27:00,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:00,183 INFO  L93              Difference]: Finished difference Result 215973 states and 221031 transitions.
[2025-03-16 15:27:00,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:00,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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 2312
[2025-03-16 15:27:00,186 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:00,187 INFO  L225             Difference]: With dead ends: 215973
[2025-03-16 15:27:00,187 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 15:27:00,255 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:00,255 INFO  L435           NwaCegarLoop]: 890 mSDtfsCounter, 688 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:00,255 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 895 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:27:00,255 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 15:27:00,255 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 15:27:00,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:27:00,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 15:27:00,256 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2312
[2025-03-16 15:27:00,256 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:00,256 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 15:27:00,257 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:27:00,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 15:27:00,257 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 15:27:00,259 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 15:27:00,260 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-16 15:27:00,262 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:27:00,264 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 15:27:02,547 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 15:27:02,563 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:27:02 BoogieIcfgContainer
[2025-03-16 15:27:02,564 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 15:27:02,564 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 15:27:02,564 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 15:27:02,564 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 15:27:02,566 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:58" (3/4) ...
[2025-03-16 15:27:02,568 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 15:27:02,613 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-03-16 15:27:02,617 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-16 15:27:02,620 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 15:27:02,623 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 15:27:02,801 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 15:27:02,801 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 15:27:02,801 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 15:27:02,802 INFO  L158              Benchmark]: Toolchain (without parser) took 67980.11ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 94.0MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,802 INFO  L158              Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 15:27:02,802 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 825.75ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 49.8MB in the end (delta: 44.2MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,803 INFO  L158              Benchmark]: Boogie Procedure Inliner took 196.38ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 64.0MB in the end (delta: -14.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,803 INFO  L158              Benchmark]: Boogie Preprocessor took 247.34ms. Allocated memory is still 142.6MB. Free memory was 64.0MB in the beginning and 47.1MB in the end (delta: 16.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,803 INFO  L158              Benchmark]: IcfgBuilder took 2744.93ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 47.1MB in the beginning and 120.2MB in the end (delta: -73.1MB). Peak memory consumption was 186.5MB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,803 INFO  L158              Benchmark]: TraceAbstraction took 63719.16ms. Allocated memory was 343.9MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 116.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,803 INFO  L158              Benchmark]: Witness Printer took 236.97ms. Allocated memory is still 4.3GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:02,804 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 825.75ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 49.8MB in the end (delta: 44.2MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 196.38ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 64.0MB in the end (delta: -14.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 247.34ms. Allocated memory is still 142.6MB. Free memory was 64.0MB in the beginning and 47.1MB in the end (delta: 16.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2744.93ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 47.1MB in the beginning and 120.2MB in the end (delta: -73.1MB). Peak memory consumption was 186.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 63719.16ms. Allocated memory was 343.9MB in the beginning and 4.3GB in the end (delta: 3.9GB). Free memory was 116.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB.
 * Witness Printer took 236.97ms. Allocated memory is still 4.3GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 115]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.4s, OverallIterations: 23, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14264 SdHoareTripleChecker+Valid, 30.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14264 mSDsluCounter, 14037 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 6931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42854 IncrementalHoareTripleChecker+Invalid, 49785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6931 mSolverCounterUnsat, 13891 mSDtfsCounter, 42854 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4478 GetRequests, 4435 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98673occurred in iteration=22, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 15870 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 25325 NumberOfCodeBlocks, 25325 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 25299 ConstructedInterpolants, 0 QuantifiedInterpolants, 58079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5051 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 34744/37774 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 4269]: Location Invariant
    Derived location invariant: (((((((((((((((((((((((((((((a24 == 3) && (a18 == 8)) && (a15 <= 4)) || (((a24 == 3) && (a15 <= 4)) && (a3 <= 417))) || ((((3 <= a24) && (a18 == 8)) && (5 == a15)) && (a3 <= 417))) || ((a24 == 3) && (5 == a15))) || (((3 <= a24) && (5 == a15)) && (a3 <= 99))) || ((((a18 == 8) && (a3 <= 115)) && (a15 == 4)) && (a24 == 2))) || (a24 == 0)) || (((3 <= a24) && (5 == a15)) && (a18 == 10))) || ((a18 == 8) && (a24 == 1))) || ((a24 == 1) && (a18 == 11))) || (((a24 == 3) && (a18 == 8)) && (a3 <= 417))) || ((a24 == 1) && (a18 == 9))) || (((2 <= a24) && (a15 <= 4)) && (a18 == 10))) || ((a24 == 2) && (5 <= a15))) || ((((a24 == 3) && (326 <= a3)) && (a18 == 11)) && (5 <= a15))) || (((a24 <= 2) && (a15 <= 4)) && (a18 == 11))) || ((a24 == 3) && (a3 <= 306))) || ((a24 == 1) && (a3 <= 417))) || ((((3 <= a24) && (5 == a15)) && (a18 == 11)) && (a3 <= 417))) || (((a24 <= 2) && (a15 <= 4)) && (a18 == 9))) || ((((a18 == 8) && (326 <= a3)) && (a24 == 2)) && (a3 <= 417))) || ((a24 == 1) && (5 == a15))) || (((3 <= a24) && (a15 <= 4)) && (a24 != 3))) || (((a24 == 3) && (a18 == 9)) && (5 <= a15))) || ((a24 == 1) && (a15 <= 4))) || (((2 <= a24) && (a15 <= 4)) && (a3 <= 99))) || ((a24 == 3) && (a18 == 10)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 15:27:02,820 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE