./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label53.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_label53.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 ebf26144b3df28ed990f2940c4e319958e06d81ae8ebc1404d0a5715fd076f97
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 15:26:30,938 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 15:26:30,997 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 15:26:31,002 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 15:26:31,002 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 15:26:31,028 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 15:26:31,028 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 15:26:31,028 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 15:26:31,029 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 15:26:31,029 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 15:26:31,029 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 15:26:31,029 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 15:26:31,030 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 15:26:31,030 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 15:26:31,030 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 15:26:31,031 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:26:31,031 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 15:26:31,031 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 15:26:31,032 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 15:26:31,032 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 15:26:31,032 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 15:26:31,032 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 15:26:31,032 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 15:26:31,032 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 -> ebf26144b3df28ed990f2940c4e319958e06d81ae8ebc1404d0a5715fd076f97
[2025-03-16 15:26:31,304 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 15:26:31,311 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 15:26:31,313 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 15:26:31,314 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 15:26:31,314 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 15:26:31,315 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label53.c
[2025-03-16 15:26:32,519 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6373b90/df48fe98b8254f70b3fc845ff830fbd8/FLAG71a690071
[2025-03-16 15:26:32,892 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 15:26:32,894 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label53.c
[2025-03-16 15:26:32,921 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6373b90/df48fe98b8254f70b3fc845ff830fbd8/FLAG71a690071
[2025-03-16 15:26:33,075 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6373b90/df48fe98b8254f70b3fc845ff830fbd8
[2025-03-16 15:26:33,077 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 15:26:33,078 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 15:26:33,079 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 15:26:33,079 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 15:26:33,082 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 15:26:33,082 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:33,082 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bcfb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33, skipping insertion in model container
[2025-03-16 15:26:33,083 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:33,140 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 15:26:33,287 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_label53.c[3698,3711]
[2025-03-16 15:26:33,712 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:26:33,720 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 15:26:33,746 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_label53.c[3698,3711]
[2025-03-16 15:26:33,918 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:26:33,933 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 15:26:33,934 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33 WrapperNode
[2025-03-16 15:26:33,934 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 15:26:33,935 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 15:26:33,935 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 15:26:33,935 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 15:26:33,939 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:26:33" (1/1) ...
[2025-03-16 15:26:33,963 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:26:33" (1/1) ...
[2025-03-16 15:26:34,108 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-16 15:26:34,109 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 15:26:34,109 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 15:26:34,109 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 15:26:34,109 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 15:26:34,116 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,117 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,146 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,221 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:26:34,222 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,222 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,292 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,310 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,324 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,336 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,355 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 15:26:34,356 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 15:26:34,356 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 15:26:34,356 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 15:26:34,357 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (1/1) ...
[2025-03-16 15:26:34,362 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:26:34,372 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:34,384 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:26:34,389 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:26:34,403 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 15:26:34,403 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 15:26:34,403 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 15:26:34,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 15:26:34,453 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 15:26:34,454 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 15:26:36,983 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-16 15:26:36,984 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-16 15:26:37,062 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-16 15:26:37,062 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 15:26:37,090 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 15:26:37,090 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 15:26:37,091 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:37 BoogieIcfgContainer
[2025-03-16 15:26:37,091 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 15:26:37,092 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 15:26:37,092 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 15:26:37,097 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 15:26:37,097 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:26:33" (1/3) ...
[2025-03-16 15:26:37,098 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edaa1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:37, skipping insertion in model container
[2025-03-16 15:26:37,098 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:33" (2/3) ...
[2025-03-16 15:26:37,099 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edaa1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:37, skipping insertion in model container
[2025-03-16 15:26:37,100 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:37" (3/3) ...
[2025-03-16 15:26:37,101 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label53.c
[2025-03-16 15:26:37,113 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 15:26:37,115 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label53.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 15:26:37,174 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 15:26:37,183 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;@438d62a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 15:26:37,184 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 15:26:37,190 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:26:37,193 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-03-16 15:26:37,194 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:37,194 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:37,194 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:37,198 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:37,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 303422043, now seen corresponding path program 1 times
[2025-03-16 15:26:37,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:37,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336866096]
[2025-03-16 15:26:37,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:37,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:37,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-03-16 15:26:37,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-03-16 15:26:37,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:37,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:37,310 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:26:37,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:37,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336866096]
[2025-03-16 15:26:37,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336866096] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:37,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:37,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:37,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978349731]
[2025-03-16 15:26:37,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:37,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 15:26:37,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:37,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 15:26:37,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:26:37,334 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 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,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:37,388 INFO  L93              Difference]: Finished difference Result 1391 states and 2763 transitions.
[2025-03-16 15:26:37,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 15:26:37,390 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32
[2025-03-16 15:26:37,390 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:37,403 INFO  L225             Difference]: With dead ends: 1391
[2025-03-16 15:26:37,403 INFO  L226             Difference]: Without dead ends: 693
[2025-03-16 15:26:37,407 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:26:37,410 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:26:37,410 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:26:37,422 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 693 states.
[2025-03-16 15:26:37,455 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693.
[2025-03-16 15:26:37,458 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:26:37,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions.
[2025-03-16 15:26:37,464 INFO  L78                 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 32
[2025-03-16 15:26:37,464 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:37,464 INFO  L471      AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions.
[2025-03-16 15:26:37,467 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 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,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions.
[2025-03-16 15:26:37,467 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-03-16 15:26:37,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:37,468 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:37,468 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 15:26:37,468 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:37,468 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:37,468 INFO  L85        PathProgramCache]: Analyzing trace with hash 427019999, now seen corresponding path program 1 times
[2025-03-16 15:26:37,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:37,468 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792779869]
[2025-03-16 15:26:37,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:37,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:37,475 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-03-16 15:26:37,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-03-16 15:26:37,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:37,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:37,639 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:26:37,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:37,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792779869]
[2025-03-16 15:26:37,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792779869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:37,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:37,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:37,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286594358]
[2025-03-16 15:26:37,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:37,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:37,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:37,642 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:37,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:37,642 INFO  L87              Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 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,894 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:39,895 INFO  L93              Difference]: Finished difference Result 2075 states and 3948 transitions.
[2025-03-16 15:26:39,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:39,895 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32
[2025-03-16 15:26:39,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:39,902 INFO  L225             Difference]: With dead ends: 2075
[2025-03-16 15:26:39,902 INFO  L226             Difference]: Without dead ends: 1383
[2025-03-16 15:26:39,903 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:39,904 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 743 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:39,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-16 15:26:39,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1383 states.
[2025-03-16 15:26:39,937 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383.
[2025-03-16 15:26:39,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions.
[2025-03-16 15:26:39,945 INFO  L78                 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 32
[2025-03-16 15:26:39,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:39,945 INFO  L471      AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions.
[2025-03-16 15:26:39,945 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 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,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions.
[2025-03-16 15:26:39,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2025-03-16 15:26:39,948 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:39,948 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,948 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 15:26:39,948 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:39,948 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:39,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -51716018, now seen corresponding path program 1 times
[2025-03-16 15:26:39,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:39,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628210148]
[2025-03-16 15:26:39,949 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:39,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:39,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-16 15:26:39,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-16 15:26:39,990 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:39,990 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:40,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:40,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:40,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628210148]
[2025-03-16 15:26:40,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628210148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:40,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:40,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:40,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170214574]
[2025-03-16 15:26:40,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:40,136 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:40,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:40,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:40,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:40,136 INFO  L87              Difference]: Start difference. First operand 1383 states and 2211 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:42,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:42,169 INFO  L93              Difference]: Finished difference Result 4145 states and 6630 transitions.
[2025-03-16 15:26:42,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:42,169 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:42,169 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:42,177 INFO  L225             Difference]: With dead ends: 4145
[2025-03-16 15:26:42,177 INFO  L226             Difference]: Without dead ends: 2763
[2025-03-16 15:26:42,179 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:42,180 INFO  L435           NwaCegarLoop]: 523 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 528 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.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:42,180 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 528 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-16 15:26:42,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2763 states.
[2025-03-16 15:26:42,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763.
[2025-03-16 15:26:42,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions.
[2025-03-16 15:26:42,219 INFO  L78                 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 97
[2025-03-16 15:26:42,219 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:42,219 INFO  L471      AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions.
[2025-03-16 15:26:42,219 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:42,219 INFO  L276                IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions.
[2025-03-16 15:26:42,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-16 15:26:42,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:42,225 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,225 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 15:26:42,225 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:42,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:42,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 205214816, now seen corresponding path program 1 times
[2025-03-16 15:26:42,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:42,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061867875]
[2025-03-16 15:26:42,226 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:42,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:42,240 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-16 15:26:42,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-16 15:26:42,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:42,259 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:42,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-16 15:26:42,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:42,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061867875]
[2025-03-16 15:26:42,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061867875] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:42,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:42,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:42,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775022945]
[2025-03-16 15:26:42,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:42,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:42,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:42,692 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:42,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:42,693 INFO  L87              Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:45,278 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:45,278 INFO  L93              Difference]: Finished difference Result 7595 states and 9793 transitions.
[2025-03-16 15:26:45,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:45,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 215
[2025-03-16 15:26:45,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:45,290 INFO  L225             Difference]: With dead ends: 7595
[2025-03-16 15:26:45,290 INFO  L226             Difference]: Without dead ends: 4833
[2025-03-16 15:26:45,293 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:45,293 INFO  L435           NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:45,294 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.5s Time]
[2025-03-16 15:26:45,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4833 states.
[2025-03-16 15:26:45,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4143.
[2025-03-16 15:26:45,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4143 states, 4142 states have (on average 1.269917914051183) internal successors, (5260), 4142 states have internal predecessors, (5260), 0 states have call successors, (0), 0 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:45,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5260 transitions.
[2025-03-16 15:26:45,347 INFO  L78                 Accepts]: Start accepts. Automaton has 4143 states and 5260 transitions. Word has length 215
[2025-03-16 15:26:45,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:45,348 INFO  L471      AbstractCegarLoop]: Abstraction has 4143 states and 5260 transitions.
[2025-03-16 15:26:45,348 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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:45,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 4143 states and 5260 transitions.
[2025-03-16 15:26:45,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 332
[2025-03-16 15:26:45,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:45,351 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 15:26:45,351 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:45,352 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:45,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 51663787, now seen corresponding path program 1 times
[2025-03-16 15:26:45,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:45,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735204435]
[2025-03-16 15:26:45,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:45,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:45,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes.
[2025-03-16 15:26:45,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements.
[2025-03-16 15:26:45,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:45,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:45,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:45,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:45,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735204435]
[2025-03-16 15:26:45,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735204435] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:45,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440620087]
[2025-03-16 15:26:45,717 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:45,718 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:45,718 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:45,721 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:45,722 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:45,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes.
[2025-03-16 15:26:45,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements.
[2025-03-16 15:26:45,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:45,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:45,823 INFO  L256         TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:45,829 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:46,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-03-16 15:26:46,169 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:46,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440620087] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:46,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:46,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-16 15:26:46,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31565404]
[2025-03-16 15:26:46,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:46,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:46,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:46,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:46,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:46,171 INFO  L87              Difference]: Start difference. First operand 4143 states and 5260 transitions. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 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:48,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:48,023 INFO  L93              Difference]: Finished difference Result 12425 states and 15777 transitions.
[2025-03-16 15:26:48,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:48,023 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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 331
[2025-03-16 15:26:48,024 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:48,041 INFO  L225             Difference]: With dead ends: 12425
[2025-03-16 15:26:48,041 INFO  L226             Difference]: Without dead ends: 8283
[2025-03-16 15:26:48,045 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:48,046 INFO  L435           NwaCegarLoop]: 543 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:48,046 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 549 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-16 15:26:48,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8283 states.
[2025-03-16 15:26:48,116 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 6903.
[2025-03-16 15:26:48,124 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:48,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 8530 transitions.
[2025-03-16 15:26:48,134 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 8530 transitions. Word has length 331
[2025-03-16 15:26:48,136 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:48,137 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 8530 transitions.
[2025-03-16 15:26:48,138 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 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:48,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 8530 transitions.
[2025-03-16 15:26:48,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 402
[2025-03-16 15:26:48,142 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:48,142 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:48,149 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-16 15:26:48,347 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:48,348 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:48,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:48,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 907538140, now seen corresponding path program 1 times
[2025-03-16 15:26:48,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:48,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402600892]
[2025-03-16 15:26:48,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:48,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:48,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes.
[2025-03-16 15:26:48,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements.
[2025-03-16 15:26:48,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:48,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:48,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 346 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-03-16 15:26:48,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:48,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402600892]
[2025-03-16 15:26:48,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402600892] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:48,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:48,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:48,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240522017]
[2025-03-16 15:26:48,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:48,740 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:48,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:48,741 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:48,741 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:48,741 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:50,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:50,573 INFO  L93              Difference]: Finished difference Result 15238 states and 18534 transitions.
[2025-03-16 15:26:50,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:50,573 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 401
[2025-03-16 15:26:50,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:50,597 INFO  L225             Difference]: With dead ends: 15238
[2025-03-16 15:26:50,597 INFO  L226             Difference]: Without dead ends: 8283
[2025-03-16 15:26:50,606 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:50,606 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:50,607 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.8s Time]
[2025-03-16 15:26:50,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8283 states.
[2025-03-16 15:26:50,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283.
[2025-03-16 15:26:50,691 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:50,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 9560 transitions.
[2025-03-16 15:26:50,706 INFO  L78                 Accepts]: Start accepts. Automaton has 8283 states and 9560 transitions. Word has length 401
[2025-03-16 15:26:50,706 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:50,706 INFO  L471      AbstractCegarLoop]: Abstraction has 8283 states and 9560 transitions.
[2025-03-16 15:26:50,707 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:50,707 INFO  L276                IsEmpty]: Start isEmpty. Operand 8283 states and 9560 transitions.
[2025-03-16 15:26:50,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 417
[2025-03-16 15:26:50,711 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:50,711 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 15:26:50,711 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:50,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:50,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -1739014220, now seen corresponding path program 1 times
[2025-03-16 15:26:50,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:50,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987816633]
[2025-03-16 15:26:50,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:50,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:50,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes.
[2025-03-16 15:26:50,782 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements.
[2025-03-16 15:26:50,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:50,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:50,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-16 15:26:50,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:50,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987816633]
[2025-03-16 15:26:50,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987816633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:50,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:50,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:26:50,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799494212]
[2025-03-16 15:26:50,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:50,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:50,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:50,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:50,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:50,999 INFO  L87              Difference]: Start difference. First operand 8283 states and 9560 transitions. Second operand  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 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:52,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:52,507 INFO  L93              Difference]: Finished difference Result 20015 states and 22948 transitions.
[2025-03-16 15:26:52,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:52,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 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 416
[2025-03-16 15:26:52,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:52,530 INFO  L225             Difference]: With dead ends: 20015
[2025-03-16 15:26:52,530 INFO  L226             Difference]: Without dead ends: 11733
[2025-03-16 15:26:52,534 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:52,535 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.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:52,535 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.4s Time]
[2025-03-16 15:26:52,541 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11733 states.
[2025-03-16 15:26:52,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 11733.
[2025-03-16 15:26:52,624 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:52,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 13130 transitions.
[2025-03-16 15:26:52,635 INFO  L78                 Accepts]: Start accepts. Automaton has 11733 states and 13130 transitions. Word has length 416
[2025-03-16 15:26:52,635 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:52,636 INFO  L471      AbstractCegarLoop]: Abstraction has 11733 states and 13130 transitions.
[2025-03-16 15:26:52,636 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 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:52,636 INFO  L276                IsEmpty]: Start isEmpty. Operand 11733 states and 13130 transitions.
[2025-03-16 15:26:52,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 425
[2025-03-16 15:26:52,639 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:52,639 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,640 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 15:26:52,640 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:52,640 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:52,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -2097078072, now seen corresponding path program 1 times
[2025-03-16 15:26:52,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:52,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909328231]
[2025-03-16 15:26:52,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:52,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:52,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes.
[2025-03-16 15:26:52,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements.
[2025-03-16 15:26:52,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:52,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:52,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:52,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:52,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909328231]
[2025-03-16 15:26:52,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909328231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:52,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:52,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:52,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621318984]
[2025-03-16 15:26:52,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:52,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:52,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:52,998 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:52,998 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:52,998 INFO  L87              Difference]: Start difference. First operand 11733 states and 13130 transitions. Second operand  has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 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,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:54,524 INFO  L93              Difference]: Finished difference Result 32435 states and 36565 transitions.
[2025-03-16 15:26:54,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:54,528 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 424
[2025-03-16 15:26:54,528 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:54,559 INFO  L225             Difference]: With dead ends: 32435
[2025-03-16 15:26:54,559 INFO  L226             Difference]: Without dead ends: 20703
[2025-03-16 15:26:54,571 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,572 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.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:54,573 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.4s Time]
[2025-03-16 15:26:54,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20703 states.
[2025-03-16 15:26:54,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20013.
[2025-03-16 15:26:54,783 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:54,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 21924 transitions.
[2025-03-16 15:26:54,809 INFO  L78                 Accepts]: Start accepts. Automaton has 20013 states and 21924 transitions. Word has length 424
[2025-03-16 15:26:54,810 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:54,810 INFO  L471      AbstractCegarLoop]: Abstraction has 20013 states and 21924 transitions.
[2025-03-16 15:26:54,811 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 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,811 INFO  L276                IsEmpty]: Start isEmpty. Operand 20013 states and 21924 transitions.
[2025-03-16 15:26:54,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 432
[2025-03-16 15:26:54,816 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:54,817 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,817 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 15:26:54,818 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:54,818 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:54,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 442158701, now seen corresponding path program 1 times
[2025-03-16 15:26:54,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:54,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368425091]
[2025-03-16 15:26:54,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:54,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:54,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes.
[2025-03-16 15:26:54,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements.
[2025-03-16 15:26:54,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:54,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:55,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-03-16 15:26:55,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:55,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368425091]
[2025-03-16 15:26:55,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368425091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:55,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:55,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:55,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010175811]
[2025-03-16 15:26:55,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:55,034 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:55,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:55,035 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:55,035 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:55,035 INFO  L87              Difference]: Start difference. First operand 20013 states and 21924 transitions. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:56,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:56,657 INFO  L93              Difference]: Finished difference Result 46235 states and 50983 transitions.
[2025-03-16 15:26:56,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:56,658 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 431
[2025-03-16 15:26:56,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:56,693 INFO  L225             Difference]: With dead ends: 46235
[2025-03-16 15:26:56,693 INFO  L226             Difference]: Without dead ends: 22773
[2025-03-16 15:26:56,712 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:56,712 INFO  L435           NwaCegarLoop]: 1112 mSDtfsCounter, 671 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 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.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:56,712 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1118 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 15:26:56,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22773 states.
[2025-03-16 15:26:56,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 20703.
[2025-03-16 15:26:56,857 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:56,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 21849 transitions.
[2025-03-16 15:26:56,875 INFO  L78                 Accepts]: Start accepts. Automaton has 20703 states and 21849 transitions. Word has length 431
[2025-03-16 15:26:56,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:56,876 INFO  L471      AbstractCegarLoop]: Abstraction has 20703 states and 21849 transitions.
[2025-03-16 15:26:56,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:56,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 20703 states and 21849 transitions.
[2025-03-16 15:26:56,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 503
[2025-03-16 15:26:56,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:56,878 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, 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, 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:56,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 15:26:56,879 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:56,879 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:56,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -519950314, now seen corresponding path program 1 times
[2025-03-16 15:26:56,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:56,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425639669]
[2025-03-16 15:26:56,879 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:56,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:56,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-03-16 15:26:56,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-03-16 15:26:56,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:56,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:57,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 346 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked.
[2025-03-16 15:26:57,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:57,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425639669]
[2025-03-16 15:26:57,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425639669] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:57,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:57,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:57,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230023256]
[2025-03-16 15:26:57,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:57,116 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:57,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:57,117 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:57,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:57,117 INFO  L87              Difference]: Start difference. First operand 20703 states and 21849 transitions. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:58,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:58,399 INFO  L93              Difference]: Finished difference Result 46235 states and 49050 transitions.
[2025-03-16 15:26:58,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:58,400 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 502
[2025-03-16 15:26:58,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:58,425 INFO  L225             Difference]: With dead ends: 46235
[2025-03-16 15:26:58,425 INFO  L226             Difference]: Without dead ends: 23463
[2025-03-16 15:26:58,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:58,441 INFO  L435           NwaCegarLoop]: 928 mSDtfsCounter, 677 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 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.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:58,441 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 934 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:58,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23463 states.
[2025-03-16 15:26:58,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23463 to 23463.
[2025-03-16 15:26:58,666 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:58,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23463 states to 23463 states and 24701 transitions.
[2025-03-16 15:26:58,687 INFO  L78                 Accepts]: Start accepts. Automaton has 23463 states and 24701 transitions. Word has length 502
[2025-03-16 15:26:58,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:58,688 INFO  L471      AbstractCegarLoop]: Abstraction has 23463 states and 24701 transitions.
[2025-03-16 15:26:58,688 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:26:58,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 23463 states and 24701 transitions.
[2025-03-16 15:26:58,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 666
[2025-03-16 15:26:58,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:58,695 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:58,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 15:26:58,696 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:58,696 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:58,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1986057316, now seen corresponding path program 1 times
[2025-03-16 15:26:58,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:58,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182260881]
[2025-03-16 15:26:58,697 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:58,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:58,728 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes.
[2025-03-16 15:26:58,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements.
[2025-03-16 15:26:58,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:58,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:58,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 510 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-03-16 15:26:58,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:58,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182260881]
[2025-03-16 15:26:58,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182260881] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:58,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:58,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:58,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978591817]
[2025-03-16 15:26:58,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:58,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:58,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:58,945 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:58,945 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:58,945 INFO  L87              Difference]: Start difference. First operand 23463 states and 24701 transitions. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:27:00,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:00,447 INFO  L93              Difference]: Finished difference Result 54515 states and 57659 transitions.
[2025-03-16 15:27:00,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:00,448 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 665
[2025-03-16 15:27:00,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:00,482 INFO  L225             Difference]: With dead ends: 54515
[2025-03-16 15:27:00,482 INFO  L226             Difference]: Without dead ends: 31053
[2025-03-16 15:27:00,499 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,500 INFO  L435           NwaCegarLoop]: 256 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:00,500 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 262 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:27:00,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31053 states.
[2025-03-16 15:27:00,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31053 to 30363.
[2025-03-16 15:27:00,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30363 states, 30362 states have (on average 1.0495026678084447) internal successors, (31865), 30362 states have internal predecessors, (31865), 0 states have call successors, (0), 0 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,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 31865 transitions.
[2025-03-16 15:27:00,771 INFO  L78                 Accepts]: Start accepts. Automaton has 30363 states and 31865 transitions. Word has length 665
[2025-03-16 15:27:00,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:00,772 INFO  L471      AbstractCegarLoop]: Abstraction has 30363 states and 31865 transitions.
[2025-03-16 15:27:00,772 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 15:27:00,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 30363 states and 31865 transitions.
[2025-03-16 15:27:00,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1224
[2025-03-16 15:27:00,784 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:00,785 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:00,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 15:27:00,785 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:00,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:00,786 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054132689, now seen corresponding path program 1 times
[2025-03-16 15:27:00,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:00,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556590251]
[2025-03-16 15:27:00,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:00,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:00,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes.
[2025-03-16 15:27:00,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements.
[2025-03-16 15:27:00,880 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:00,880 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:01,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 1701 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked.
[2025-03-16 15:27:01,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:01,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556590251]
[2025-03-16 15:27:01,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556590251] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:01,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:01,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:01,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306641130]
[2025-03-16 15:27:01,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:01,385 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:01,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:01,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:01,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:01,385 INFO  L87              Difference]: Start difference. First operand 30363 states and 31865 transitions. Second operand  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:02,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:02,186 INFO  L93              Difference]: Finished difference Result 60057 states and 63060 transitions.
[2025-03-16 15:27:02,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:02,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1223
[2025-03-16 15:27:02,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:02,216 INFO  L225             Difference]: With dead ends: 60057
[2025-03-16 15:27:02,216 INFO  L226             Difference]: Without dead ends: 30363
[2025-03-16 15:27:02,236 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:02,236 INFO  L435           NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:02,237 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.7s Time]
[2025-03-16 15:27:02,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30363 states.
[2025-03-16 15:27:02,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30363.
[2025-03-16 15:27:02,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30363 states, 30362 states have (on average 1.0493709241815428) internal successors, (31861), 30362 states have internal predecessors, (31861), 0 states have call successors, (0), 0 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:02,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 31861 transitions.
[2025-03-16 15:27:02,465 INFO  L78                 Accepts]: Start accepts. Automaton has 30363 states and 31861 transitions. Word has length 1223
[2025-03-16 15:27:02,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:02,466 INFO  L471      AbstractCegarLoop]: Abstraction has 30363 states and 31861 transitions.
[2025-03-16 15:27:02,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:02,466 INFO  L276                IsEmpty]: Start isEmpty. Operand 30363 states and 31861 transitions.
[2025-03-16 15:27:02,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1237
[2025-03-16 15:27:02,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:02,480 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 15:27:02,480 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 15:27:02,480 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:02,481 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:02,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -1381747888, now seen corresponding path program 1 times
[2025-03-16 15:27:02,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:02,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366566054]
[2025-03-16 15:27:02,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:02,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:02,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1236 statements into 1 equivalence classes.
[2025-03-16 15:27:02,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1236 of 1236 statements.
[2025-03-16 15:27:02,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:02,568 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:03,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 1508 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked.
[2025-03-16 15:27:03,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:03,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366566054]
[2025-03-16 15:27:03,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366566054] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:03,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:03,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:03,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404357475]
[2025-03-16 15:27:03,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:03,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:27:03,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:03,457 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:27:03,457 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:27:03,457 INFO  L87              Difference]: Start difference. First operand 30363 states and 31861 transitions. Second operand  has 4 states, 4 states have (on average 205.0) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:05,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:05,358 INFO  L93              Difference]: Finished difference Result 60035 states and 63030 transitions.
[2025-03-16 15:27:05,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:27:05,358 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 205.0) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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 1236
[2025-03-16 15:27:05,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:05,387 INFO  L225             Difference]: With dead ends: 60035
[2025-03-16 15:27:05,387 INFO  L226             Difference]: Without dead ends: 30363
[2025-03-16 15:27:05,403 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:27:05,403 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 978 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:05,403 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 89 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 15:27:05,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30363 states.
[2025-03-16 15:27:05,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30363.
[2025-03-16 15:27:05,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30363 states, 30362 states have (on average 1.0490415651142877) internal successors, (31851), 30362 states have internal predecessors, (31851), 0 states have call successors, (0), 0 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:05,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 31851 transitions.
[2025-03-16 15:27:05,619 INFO  L78                 Accepts]: Start accepts. Automaton has 30363 states and 31851 transitions. Word has length 1236
[2025-03-16 15:27:05,620 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:05,620 INFO  L471      AbstractCegarLoop]: Abstraction has 30363 states and 31851 transitions.
[2025-03-16 15:27:05,620 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 205.0) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:05,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 30363 states and 31851 transitions.
[2025-03-16 15:27:05,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1257
[2025-03-16 15:27:05,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:05,632 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:05,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 15:27:05,633 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:05,633 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:05,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 1137812902, now seen corresponding path program 1 times
[2025-03-16 15:27:05,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:05,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917096122]
[2025-03-16 15:27:05,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:05,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:05,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1256 statements into 1 equivalence classes.
[2025-03-16 15:27:05,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1256 of 1256 statements.
[2025-03-16 15:27:05,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:05,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:06,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1525 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-16 15:27:06,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:06,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917096122]
[2025-03-16 15:27:06,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917096122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:06,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:06,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:06,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165866836]
[2025-03-16 15:27:06,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:06,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:06,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:06,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:06,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:06,185 INFO  L87              Difference]: Start difference. First operand 30363 states and 31851 transitions. Second operand  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 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:07,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:07,695 INFO  L93              Difference]: Finished difference Result 68315 states and 71984 transitions.
[2025-03-16 15:27:07,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:07,696 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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 1256
[2025-03-16 15:27:07,697 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:07,737 INFO  L225             Difference]: With dead ends: 68315
[2025-03-16 15:27:07,738 INFO  L226             Difference]: Without dead ends: 38643
[2025-03-16 15:27:07,773 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:07,774 INFO  L435           NwaCegarLoop]: 948 mSDtfsCounter, 454 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:07,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 953 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:27:07,813 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38643 states.
[2025-03-16 15:27:08,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38643 to 38643.
[2025-03-16 15:27:08,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38643 states, 38642 states have (on average 1.047073132860618) internal successors, (40461), 38642 states have internal predecessors, (40461), 0 states have call successors, (0), 0 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:08,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38643 states to 38643 states and 40461 transitions.
[2025-03-16 15:27:08,130 INFO  L78                 Accepts]: Start accepts. Automaton has 38643 states and 40461 transitions. Word has length 1256
[2025-03-16 15:27:08,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:08,131 INFO  L471      AbstractCegarLoop]: Abstraction has 38643 states and 40461 transitions.
[2025-03-16 15:27:08,131 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 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:08,131 INFO  L276                IsEmpty]: Start isEmpty. Operand 38643 states and 40461 transitions.
[2025-03-16 15:27:08,144 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1297
[2025-03-16 15:27:08,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:08,145 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, 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, 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:27:08,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 15:27:08,145 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:08,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:08,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 459301042, now seen corresponding path program 1 times
[2025-03-16 15:27:08,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:08,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400116361]
[2025-03-16 15:27:08,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:08,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:08,201 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes.
[2025-03-16 15:27:08,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements.
[2025-03-16 15:27:08,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:08,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:09,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 2204 backedges. 1377 proven. 614 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked.
[2025-03-16 15:27:09,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:09,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400116361]
[2025-03-16 15:27:09,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400116361] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:27:09,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523523523]
[2025-03-16 15:27:09,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:09,466 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:27:09,466 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:27:09,471 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:27:09,473 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:27:09,611 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes.
[2025-03-16 15:27:09,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements.
[2025-03-16 15:27:09,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:09,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:09,794 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:27:09,812 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:27:09,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 2204 backedges. 1389 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked.
[2025-03-16 15:27:09,957 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:27:09,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523523523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:09,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:27:09,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-16 15:27:09,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865363453]
[2025-03-16 15:27:09,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:09,959 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:09,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:09,960 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:09,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 15:27:09,961 INFO  L87              Difference]: Start difference. First operand 38643 states and 40461 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:27:11,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:11,420 INFO  L93              Difference]: Finished difference Result 90395 states and 95088 transitions.
[2025-03-16 15:27:11,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:11,421 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 1296
[2025-03-16 15:27:11,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:11,477 INFO  L225             Difference]: With dead ends: 90395
[2025-03-16 15:27:11,477 INFO  L226             Difference]: Without dead ends: 52443
[2025-03-16 15:27:11,506 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1303 GetRequests, 1296 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:27:11,506 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 643 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:11,507 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 131 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:27:11,540 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52443 states.
[2025-03-16 15:27:11,914 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52443 to 51753.
[2025-03-16 15:27:11,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51753 states, 51752 states have (on average 1.04513835214098) internal successors, (54088), 51752 states have internal predecessors, (54088), 0 states have call successors, (0), 0 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:11,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51753 states to 51753 states and 54088 transitions.
[2025-03-16 15:27:11,991 INFO  L78                 Accepts]: Start accepts. Automaton has 51753 states and 54088 transitions. Word has length 1296
[2025-03-16 15:27:11,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:11,992 INFO  L471      AbstractCegarLoop]: Abstraction has 51753 states and 54088 transitions.
[2025-03-16 15:27:11,992 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:27:11,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 51753 states and 54088 transitions.
[2025-03-16 15:27:12,007 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1365
[2025-03-16 15:27:12,007 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:12,008 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:12,014 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-16 15:27:12,208 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:27:12,208 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:12,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:12,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967875237, now seen corresponding path program 1 times
[2025-03-16 15:27:12,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:12,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285559431]
[2025-03-16 15:27:12,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:12,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:12,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1364 statements into 1 equivalence classes.
[2025-03-16 15:27:12,300 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1364 of 1364 statements.
[2025-03-16 15:27:12,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:12,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:12,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 2142 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked.
[2025-03-16 15:27:12,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:12,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285559431]
[2025-03-16 15:27:12,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285559431] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:12,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:12,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:12,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424461997]
[2025-03-16 15:27:12,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:12,812 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:12,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:12,812 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:12,812 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:12,812 INFO  L87              Difference]: Start difference. First operand 51753 states and 54088 transitions. Second operand  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:14,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:14,249 INFO  L93              Difference]: Finished difference Result 112475 states and 118035 transitions.
[2025-03-16 15:27:14,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:14,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1364
[2025-03-16 15:27:14,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:14,312 INFO  L225             Difference]: With dead ends: 112475
[2025-03-16 15:27:14,313 INFO  L226             Difference]: Without dead ends: 61413
[2025-03-16 15:27:14,348 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:14,348 INFO  L435           NwaCegarLoop]: 931 mSDtfsCounter, 664 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:14,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 937 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:27:14,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61413 states.
[2025-03-16 15:27:14,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 60723.
[2025-03-16 15:27:14,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60723 states, 60722 states have (on average 1.0435756398010605) internal successors, (63368), 60722 states have internal predecessors, (63368), 0 states have call successors, (0), 0 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:14,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 63368 transitions.
[2025-03-16 15:27:14,812 INFO  L78                 Accepts]: Start accepts. Automaton has 60723 states and 63368 transitions. Word has length 1364
[2025-03-16 15:27:14,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:14,813 INFO  L471      AbstractCegarLoop]: Abstraction has 60723 states and 63368 transitions.
[2025-03-16 15:27:14,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:14,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 60723 states and 63368 transitions.
[2025-03-16 15:27:14,833 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1400
[2025-03-16 15:27:14,833 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:14,833 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:14,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 15:27:14,833 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:14,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:14,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 1854426256, now seen corresponding path program 1 times
[2025-03-16 15:27:14,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:14,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001734853]
[2025-03-16 15:27:14,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:14,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:14,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1399 statements into 1 equivalence classes.
[2025-03-16 15:27:14,926 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1399 of 1399 statements.
[2025-03-16 15:27:14,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:14,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:15,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 1978 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked.
[2025-03-16 15:27:15,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:15,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001734853]
[2025-03-16 15:27:15,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001734853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:15,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:15,360 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:15,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60539744]
[2025-03-16 15:27:15,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:15,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:15,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:15,361 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:15,361 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:15,361 INFO  L87              Difference]: Start difference. First operand 60723 states and 63368 transitions. Second operand  has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:16,791 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:16,792 INFO  L93              Difference]: Finished difference Result 130415 states and 136272 transitions.
[2025-03-16 15:27:16,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:16,792 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1399
[2025-03-16 15:27:16,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:16,877 INFO  L225             Difference]: With dead ends: 130415
[2025-03-16 15:27:16,879 INFO  L226             Difference]: Without dead ends: 70383
[2025-03-16 15:27:16,912 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:16,913 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 666 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:16,913 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 257 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:27:16,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70383 states.
[2025-03-16 15:27:17,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70383 to 61413.
[2025-03-16 15:27:17,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61413 states, 61412 states have (on average 1.0432814433661173) internal successors, (64070), 61412 states have internal predecessors, (64070), 0 states have call successors, (0), 0 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:17,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 64070 transitions.
[2025-03-16 15:27:17,447 INFO  L78                 Accepts]: Start accepts. Automaton has 61413 states and 64070 transitions. Word has length 1399
[2025-03-16 15:27:17,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:17,447 INFO  L471      AbstractCegarLoop]: Abstraction has 61413 states and 64070 transitions.
[2025-03-16 15:27:17,447 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:17,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 61413 states and 64070 transitions.
[2025-03-16 15:27:17,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1409
[2025-03-16 15:27:17,465 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:17,466 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:17,466 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 15:27:17,466 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:17,467 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:17,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -1207563470, now seen corresponding path program 1 times
[2025-03-16 15:27:17,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:17,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481743796]
[2025-03-16 15:27:17,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:17,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:17,530 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1408 statements into 1 equivalence classes.
[2025-03-16 15:27:17,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1408 of 1408 statements.
[2025-03-16 15:27:17,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:17,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:18,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 1776 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked.
[2025-03-16 15:27:18,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:18,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481743796]
[2025-03-16 15:27:18,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481743796] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:18,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:18,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:18,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892401531]
[2025-03-16 15:27:18,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:18,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:18,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:18,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:18,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:18,075 INFO  L87              Difference]: Start difference. First operand 61413 states and 64070 transitions. Second operand  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:19,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:19,353 INFO  L93              Difference]: Finished difference Result 122135 states and 127448 transitions.
[2025-03-16 15:27:19,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:19,353 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1408
[2025-03-16 15:27:19,354 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:19,411 INFO  L225             Difference]: With dead ends: 122135
[2025-03-16 15:27:19,411 INFO  L226             Difference]: Without dead ends: 61413
[2025-03-16 15:27:19,444 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:19,445 INFO  L435           NwaCegarLoop]: 879 mSDtfsCounter, 725 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:19,445 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 885 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 15:27:19,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61413 states.
[2025-03-16 15:27:20,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 60033.
[2025-03-16 15:27:20,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60033 states, 60032 states have (on average 1.0307835820895523) internal successors, (61880), 60032 states have internal predecessors, (61880), 0 states have call successors, (0), 0 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:20,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 61880 transitions.
[2025-03-16 15:27:20,134 INFO  L78                 Accepts]: Start accepts. Automaton has 60033 states and 61880 transitions. Word has length 1408
[2025-03-16 15:27:20,135 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:20,135 INFO  L471      AbstractCegarLoop]: Abstraction has 60033 states and 61880 transitions.
[2025-03-16 15:27:20,135 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:20,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 60033 states and 61880 transitions.
[2025-03-16 15:27:20,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1417
[2025-03-16 15:27:20,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:20,167 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:20,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 15:27:20,167 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:20,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:20,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 1482298951, now seen corresponding path program 1 times
[2025-03-16 15:27:20,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:20,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903045988]
[2025-03-16 15:27:20,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:20,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:20,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1416 statements into 1 equivalence classes.
[2025-03-16 15:27:20,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1416 of 1416 statements.
[2025-03-16 15:27:20,327 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:20,327 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:20,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 1700 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked.
[2025-03-16 15:27:20,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:20,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903045988]
[2025-03-16 15:27:20,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903045988] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:20,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:20,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:20,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185537936]
[2025-03-16 15:27:20,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:20,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:20,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:20,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:20,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:20,898 INFO  L87              Difference]: Start difference. First operand 60033 states and 61880 transitions. Second operand  has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 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:22,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:22,296 INFO  L93              Difference]: Finished difference Result 120065 states and 123764 transitions.
[2025-03-16 15:27:22,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:22,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 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 1416
[2025-03-16 15:27:22,298 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:22,363 INFO  L225             Difference]: With dead ends: 120065
[2025-03-16 15:27:22,363 INFO  L226             Difference]: Without dead ends: 60723
[2025-03-16 15:27:22,398 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:22,399 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 675 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:22,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 77 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:27:22,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60723 states.
[2025-03-16 15:27:22,887 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 59343.
[2025-03-16 15:27:22,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59343 states, 59342 states have (on average 1.0300967274443058) internal successors, (61128), 59342 states have internal predecessors, (61128), 0 states have call successors, (0), 0 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:22,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59343 states to 59343 states and 61128 transitions.
[2025-03-16 15:27:22,977 INFO  L78                 Accepts]: Start accepts. Automaton has 59343 states and 61128 transitions. Word has length 1416
[2025-03-16 15:27:22,978 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:22,978 INFO  L471      AbstractCegarLoop]: Abstraction has 59343 states and 61128 transitions.
[2025-03-16 15:27:22,978 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 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:22,978 INFO  L276                IsEmpty]: Start isEmpty. Operand 59343 states and 61128 transitions.
[2025-03-16 15:27:23,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1475
[2025-03-16 15:27:23,010 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:27:23,012 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,012 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-16 15:27:23,012 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:27:23,012 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:27:23,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 451672179, now seen corresponding path program 1 times
[2025-03-16 15:27:23,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:27:23,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571039858]
[2025-03-16 15:27:23,013 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:27:23,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:27:23,073 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1474 statements into 1 equivalence classes.
[2025-03-16 15:27:23,114 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1474 of 1474 statements.
[2025-03-16 15:27:23,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:27:23,115 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:27:23,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 1870 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked.
[2025-03-16 15:27:23,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:27:23,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571039858]
[2025-03-16 15:27:23,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571039858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:27:23,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:27:23,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:27:23,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663336243]
[2025-03-16 15:27:23,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:27:23,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:27:23,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:27:23,702 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:27:23,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:27:23,702 INFO  L87              Difference]: Start difference. First operand 59343 states and 61128 transitions. Second operand  has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:24,985 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:27:24,985 INFO  L93              Difference]: Finished difference Result 117993 states and 121563 transitions.
[2025-03-16 15:27:24,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:27:24,986 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 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 1474
[2025-03-16 15:27:24,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:27:24,987 INFO  L225             Difference]: With dead ends: 117993
[2025-03-16 15:27:24,987 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 15:27:25,021 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:25,021 INFO  L435           NwaCegarLoop]: 836 mSDtfsCounter, 304 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:27:25,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 841 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:27:25,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 15:27:25,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 15:27:25,022 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:25,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 15:27:25,022 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1474
[2025-03-16 15:27:25,022 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:27:25,022 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 15:27:25,022 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:25,023 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 15:27:25,023 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 15:27:25,025 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 15:27:25,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-16 15:27:25,027 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]
[2025-03-16 15:27:25,033 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 15:27:25,814 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 15:27:25,831 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:27:25 BoogieIcfgContainer
[2025-03-16 15:27:25,832 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 15:27:25,832 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 15:27:25,832 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 15:27:25,833 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 15:27:25,833 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:37" (3/4) ...
[2025-03-16 15:27:25,834 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 15:27:25,875 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-03-16 15:27:25,878 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-16 15:27:25,882 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 15:27:25,885 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 15:27:26,064 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 15:27:26,064 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 15:27:26,064 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 15:27:26,065 INFO  L158              Benchmark]: Toolchain (without parser) took 52986.79ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 102.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 706.5MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,065 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 15:27:26,065 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 855.89ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 56.6MB in the end (delta: 45.4MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,065 INFO  L158              Benchmark]: Boogie Procedure Inliner took 173.42ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 56.6MB in the beginning and 312.7MB in the end (delta: -256.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,066 INFO  L158              Benchmark]: Boogie Preprocessor took 246.06ms. Allocated memory is still 385.9MB. Free memory was 312.7MB in the beginning and 260.7MB in the end (delta: 51.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,066 INFO  L158              Benchmark]: IcfgBuilder took 2734.97ms. Allocated memory is still 385.9MB. Free memory was 260.7MB in the beginning and 143.8MB in the end (delta: 117.0MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,066 INFO  L158              Benchmark]: TraceAbstraction took 48739.62ms. Allocated memory was 385.9MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 143.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,066 INFO  L158              Benchmark]: Witness Printer took 231.96ms. Allocated memory is still 2.4GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-03-16 15:27:26,067 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 855.89ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 56.6MB in the end (delta: 45.4MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 173.42ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 56.6MB in the beginning and 312.7MB in the end (delta: -256.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 246.06ms. Allocated memory is still 385.9MB. Free memory was 312.7MB in the beginning and 260.7MB in the end (delta: 51.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2734.97ms. Allocated memory is still 385.9MB. Free memory was 260.7MB in the beginning and 143.8MB in the end (delta: 117.0MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 48739.62ms. Allocated memory was 385.9MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 143.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
 * Witness Printer took 231.96ms. Allocated memory is still 2.4GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 46.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: 118]: 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: 47.9s, OverallIterations: 20, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12426 SdHoareTripleChecker+Valid, 27.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12426 mSDsluCounter, 12632 SdHoareTripleChecker+Invalid, 22.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 5953 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37944 IncrementalHoareTripleChecker+Invalid, 43897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5953 mSolverCounterUnsat, 12499 mSDtfsCounter, 37944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1687 GetRequests, 1656 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61413occurred in iteration=17, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 18630 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 17245 NumberOfCodeBlocks, 17245 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 17223 ConstructedInterpolants, 0 QuantifiedInterpolants, 35754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1944 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 19832/20476 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: (((((((((((((a18 <= 11) && (a24 <= 3)) && (a15 == 6)) || (((5 == a15) && (a24 <= 3)) && (a18 == 12))) || ((5 == a15) && (a18 <= 11))) || ((a24 == 0) && (a15 <= 4))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 12))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || (((a15 <= 4) && (a18 == 12)) && (a3 <= 99))) || (((5 == a15) && (a18 == 12)) && (a3 <= 99))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a18 <= 11))) || (((a24 == 1) && (a15 == 6)) && (a3 <= 99)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 15:27:26,080 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