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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
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/Problem03_label11.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 698befc2b2b3848a03ec5b9664ba6dadb47a33cbe123de396a3ce9bbb5d1873c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:49:51,096 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:49:51,151 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:49:51,155 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:49:51,155 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:49:51,170 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:49:51,171 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:49:51,171 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:49:51,171 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:49:51,171 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:49:51,171 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:49:51,171 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:49:51,172 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:49:51,172 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:49:51,172 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:49:51,173 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:49:51,173 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:51,174 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:49:51,174 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:49:51,175 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:49:51,175 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:49:51,175 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 -> 698befc2b2b3848a03ec5b9664ba6dadb47a33cbe123de396a3ce9bbb5d1873c
[2025-03-03 09:49:51,511 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:49:51,519 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:49:51,521 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:49:51,523 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:49:51,523 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:49:51,525 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label11.c
[2025-03-03 09:49:52,656 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb1df5e/162cb3f99c024edfb80a157029ba8419/FLAGc731768bd
[2025-03-03 09:49:52,947 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:49:52,948 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label11.c
[2025-03-03 09:49:52,968 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb1df5e/162cb3f99c024edfb80a157029ba8419/FLAGc731768bd
[2025-03-03 09:49:53,222 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb1df5e/162cb3f99c024edfb80a157029ba8419
[2025-03-03 09:49:53,224 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:49:53,225 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:49:53,226 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:53,226 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:49:53,229 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:49:53,230 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,230 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65eb6918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53, skipping insertion in model container
[2025-03-03 09:49:53,230 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,278 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:49:53,599 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/Problem03_label11.c[60283,60296]
[2025-03-03 09:49:53,626 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:53,635 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:49:53,757 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/Problem03_label11.c[60283,60296]
[2025-03-03 09:49:53,771 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:53,785 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:49:53,786 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53 WrapperNode
[2025-03-03 09:49:53,786 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:53,787 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:53,787 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:49:53,787 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:49:53,792 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,819 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,925 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-03 09:49:53,926 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:53,926 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:49:53,927 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:49:53,927 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:49:53,932 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,933 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,943 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,977 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-03 09:49:53,980 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:53,981 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,021 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,026 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,033 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,039 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,048 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:49:54,050 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:49:54,050 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:49:54,050 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:49:54,051 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (1/1) ...
[2025-03-03 09:49:54,055 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:54,065 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:54,077 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-03 09:49:54,083 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-03 09:49:54,098 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:49:54,098 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:49:54,098 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:49:54,098 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:49:54,161 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:49:54,163 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:49:55,660 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-03 09:49:55,660 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:49:55,676 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:49:55,678 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:49:55,679 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:55 BoogieIcfgContainer
[2025-03-03 09:49:55,679 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:49:55,681 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:49:55,681 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:49:55,684 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:49:55,684 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:53" (1/3) ...
[2025-03-03 09:49:55,685 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d04a85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:55, skipping insertion in model container
[2025-03-03 09:49:55,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:53" (2/3) ...
[2025-03-03 09:49:55,686 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d04a85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:55, skipping insertion in model container
[2025-03-03 09:49:55,686 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:55" (3/3) ...
[2025-03-03 09:49:55,687 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label11.c
[2025-03-03 09:49:55,699 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:49:55,702 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label11.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:49:55,750 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:49:55,757 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;@1daf0bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:49:55,758 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:49:55,761 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-03 09:49:55,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-03-03 09:49:55,772 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:55,772 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:55,773 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:55,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:55,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 479407199, now seen corresponding path program 1 times
[2025-03-03 09:49:55,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:55,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524606658]
[2025-03-03 09:49:55,787 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:55,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:55,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-03 09:49:56,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-03 09:49:56,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:56,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:56,658 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-03 09:49:56,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:56,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524606658]
[2025-03-03 09:49:56,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524606658] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:56,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:56,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:56,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871692069]
[2025-03-03 09:49:56,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:56,665 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:56,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:56,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:56,683 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:56,686 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-03 09:49:57,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:57,579 INFO  L93              Difference]: Finished difference Result 823 states and 1456 transitions.
[2025-03-03 09:49:57,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:57,581 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 193
[2025-03-03 09:49:57,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:57,590 INFO  L225             Difference]: With dead ends: 823
[2025-03-03 09:49:57,590 INFO  L226             Difference]: Without dead ends: 444
[2025-03-03 09:49:57,593 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-03 09:49:57,598 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 38 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:57,598 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 244 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:49:57,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 444 states.
[2025-03-03 09:49:57,633 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443.
[2025-03-03 09:49:57,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 443 states, 442 states have (on average 1.420814479638009) internal successors, (628), 442 states have internal predecessors, (628), 0 states have call successors, (0), 0 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-03 09:49:57,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 628 transitions.
[2025-03-03 09:49:57,643 INFO  L78                 Accepts]: Start accepts. Automaton has 443 states and 628 transitions. Word has length 193
[2025-03-03 09:49:57,644 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:57,644 INFO  L471      AbstractCegarLoop]: Abstraction has 443 states and 628 transitions.
[2025-03-03 09:49:57,644 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-03 09:49:57,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 443 states and 628 transitions.
[2025-03-03 09:49:57,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-03-03 09:49:57,649 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:57,650 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:49:57,650 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:49:57,650 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:57,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:57,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 396637129, now seen corresponding path program 1 times
[2025-03-03 09:49:57,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:57,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895831803]
[2025-03-03 09:49:57,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:57,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:57,690 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes.
[2025-03-03 09:49:57,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements.
[2025-03-03 09:49:57,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:57,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:57,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:57,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:57,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895831803]
[2025-03-03 09:49:57,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895831803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:57,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:57,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:57,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716758158]
[2025-03-03 09:49:57,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:57,840 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:57,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:57,842 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:57,842 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:57,842 INFO  L87              Difference]: Start difference. First operand 443 states and 628 transitions. Second operand  has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-03 09:49:58,612 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:58,612 INFO  L93              Difference]: Finished difference Result 1310 states and 1864 transitions.
[2025-03-03 09:49:58,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:58,614 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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 201
[2025-03-03 09:49:58,614 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:58,620 INFO  L225             Difference]: With dead ends: 1310
[2025-03-03 09:49:58,620 INFO  L226             Difference]: Without dead ends: 869
[2025-03-03 09:49:58,621 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-03 09:49:58,622 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:58,622 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:49:58,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 869 states.
[2025-03-03 09:49:58,650 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 855.
[2025-03-03 09:49:58,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 855 states, 854 states have (on average 1.3875878220140516) internal successors, (1185), 854 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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-03 09:49:58,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1185 transitions.
[2025-03-03 09:49:58,654 INFO  L78                 Accepts]: Start accepts. Automaton has 855 states and 1185 transitions. Word has length 201
[2025-03-03 09:49:58,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:58,654 INFO  L471      AbstractCegarLoop]: Abstraction has 855 states and 1185 transitions.
[2025-03-03 09:49:58,655 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-03 09:49:58,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 855 states and 1185 transitions.
[2025-03-03 09:49:58,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-03 09:49:58,657 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:58,659 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:49:58,659 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:49:58,659 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:58,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:58,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -1334090605, now seen corresponding path program 1 times
[2025-03-03 09:49:58,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:58,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526146715]
[2025-03-03 09:49:58,660 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:58,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:58,698 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-03 09:49:58,706 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-03 09:49:58,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:58,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:59,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:59,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:59,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526146715]
[2025-03-03 09:49:59,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526146715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:59,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:59,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:59,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671856302]
[2025-03-03 09:49:59,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:59,013 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:59,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:59,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:59,014 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:59,014 INFO  L87              Difference]: Start difference. First operand 855 states and 1185 transitions. Second operand  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-03 09:49:59,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:59,736 INFO  L93              Difference]: Finished difference Result 2540 states and 3522 transitions.
[2025-03-03 09:49:59,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:59,736 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 205
[2025-03-03 09:49:59,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:59,741 INFO  L225             Difference]: With dead ends: 2540
[2025-03-03 09:49:59,742 INFO  L226             Difference]: Without dead ends: 1687
[2025-03-03 09:49:59,743 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-03 09:49:59,743 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:59,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:49:59,745 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1687 states.
[2025-03-03 09:49:59,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685.
[2025-03-03 09:49:59,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1685 states, 1684 states have (on average 1.3610451306413303) internal successors, (2292), 1684 states have internal predecessors, (2292), 0 states have call successors, (0), 0 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-03 09:49:59,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2292 transitions.
[2025-03-03 09:49:59,775 INFO  L78                 Accepts]: Start accepts. Automaton has 1685 states and 2292 transitions. Word has length 205
[2025-03-03 09:49:59,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:59,775 INFO  L471      AbstractCegarLoop]: Abstraction has 1685 states and 2292 transitions.
[2025-03-03 09:49:59,776 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-03 09:49:59,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 1685 states and 2292 transitions.
[2025-03-03 09:49:59,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-03-03 09:49:59,779 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:59,779 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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]
[2025-03-03 09:49:59,779 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:49:59,779 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:59,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:59,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 1772725156, now seen corresponding path program 1 times
[2025-03-03 09:49:59,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:59,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696008828]
[2025-03-03 09:49:59,780 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:59,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:59,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-03-03 09:49:59,837 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-03-03 09:49:59,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:59,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:00,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:00,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:00,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696008828]
[2025-03-03 09:50:00,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696008828] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:00,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:00,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:00,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656475636]
[2025-03-03 09:50:00,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:00,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:00,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:00,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:00,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:00,239 INFO  L87              Difference]: Start difference. First operand 1685 states and 2292 transitions. Second operand  has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-03 09:50:01,018 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:01,018 INFO  L93              Difference]: Finished difference Result 3696 states and 5127 transitions.
[2025-03-03 09:50:01,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:01,019 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 208
[2025-03-03 09:50:01,019 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:01,024 INFO  L225             Difference]: With dead ends: 3696
[2025-03-03 09:50:01,024 INFO  L226             Difference]: Without dead ends: 1665
[2025-03-03 09:50:01,026 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-03 09:50:01,027 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:01,027 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:01,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1665 states.
[2025-03-03 09:50:01,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665.
[2025-03-03 09:50:01,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1665 states, 1664 states have (on average 1.2536057692307692) internal successors, (2086), 1664 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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-03 09:50:01,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2086 transitions.
[2025-03-03 09:50:01,057 INFO  L78                 Accepts]: Start accepts. Automaton has 1665 states and 2086 transitions. Word has length 208
[2025-03-03 09:50:01,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:01,057 INFO  L471      AbstractCegarLoop]: Abstraction has 1665 states and 2086 transitions.
[2025-03-03 09:50:01,058 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-03 09:50:01,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 1665 states and 2086 transitions.
[2025-03-03 09:50:01,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-03 09:50:01,060 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:01,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:01,061 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:50:01,061 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:01,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:01,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -1756541154, now seen corresponding path program 1 times
[2025-03-03 09:50:01,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:01,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576173130]
[2025-03-03 09:50:01,062 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:01,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:01,090 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-03 09:50:01,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-03 09:50:01,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:01,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:01,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:01,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:01,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576173130]
[2025-03-03 09:50:01,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576173130] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:01,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:01,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:01,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429007805]
[2025-03-03 09:50:01,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:01,239 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:01,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:01,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:01,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:01,240 INFO  L87              Difference]: Start difference. First operand 1665 states and 2086 transitions. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:01,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:01,779 INFO  L93              Difference]: Finished difference Result 4164 states and 5209 transitions.
[2025-03-03 09:50:01,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:01,779 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221
[2025-03-03 09:50:01,779 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:01,788 INFO  L225             Difference]: With dead ends: 4164
[2025-03-03 09:50:01,788 INFO  L226             Difference]: Without dead ends: 2501
[2025-03-03 09:50:01,791 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-03 09:50:01,791 INFO  L435           NwaCegarLoop]: 45 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:01,793 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 58 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:01,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2501 states.
[2025-03-03 09:50:01,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2497.
[2025-03-03 09:50:01,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2497 states, 2496 states have (on average 1.2463942307692308) internal successors, (3111), 2496 states have internal predecessors, (3111), 0 states have call successors, (0), 0 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-03 09:50:01,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 3111 transitions.
[2025-03-03 09:50:01,840 INFO  L78                 Accepts]: Start accepts. Automaton has 2497 states and 3111 transitions. Word has length 221
[2025-03-03 09:50:01,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:01,840 INFO  L471      AbstractCegarLoop]: Abstraction has 2497 states and 3111 transitions.
[2025-03-03 09:50:01,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:01,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 2497 states and 3111 transitions.
[2025-03-03 09:50:01,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-03 09:50:01,845 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:01,846 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]
[2025-03-03 09:50:01,846 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:50:01,846 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:01,846 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:01,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 1631965752, now seen corresponding path program 1 times
[2025-03-03 09:50:01,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:01,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709481344]
[2025-03-03 09:50:01,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:01,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:01,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-03 09:50:01,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-03 09:50:01,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:01,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:02,228 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-03 09:50:02,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:02,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709481344]
[2025-03-03 09:50:02,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709481344] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:02,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:02,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:02,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704842687]
[2025-03-03 09:50:02,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:02,231 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:02,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:02,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:02,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:02,233 INFO  L87              Difference]: Start difference. First operand 2497 states and 3111 transitions. Second operand  has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:03,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:03,232 INFO  L93              Difference]: Finished difference Result 7338 states and 9272 transitions.
[2025-03-03 09:50:03,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:03,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224
[2025-03-03 09:50:03,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:03,246 INFO  L225             Difference]: With dead ends: 7338
[2025-03-03 09:50:03,246 INFO  L226             Difference]: Without dead ends: 4147
[2025-03-03 09:50:03,250 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-03 09:50:03,252 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 192 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:03,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 146 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 09:50:03,255 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4147 states.
[2025-03-03 09:50:03,310 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 4145.
[2025-03-03 09:50:03,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4145 states, 4144 states have (on average 1.2331081081081081) internal successors, (5110), 4144 states have internal predecessors, (5110), 0 states have call successors, (0), 0 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-03 09:50:03,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 5110 transitions.
[2025-03-03 09:50:03,327 INFO  L78                 Accepts]: Start accepts. Automaton has 4145 states and 5110 transitions. Word has length 224
[2025-03-03 09:50:03,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:03,328 INFO  L471      AbstractCegarLoop]: Abstraction has 4145 states and 5110 transitions.
[2025-03-03 09:50:03,329 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:03,329 INFO  L276                IsEmpty]: Start isEmpty. Operand 4145 states and 5110 transitions.
[2025-03-03 09:50:03,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 09:50:03,334 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:03,334 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:03,334 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:50:03,334 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:03,334 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:03,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -836811911, now seen corresponding path program 1 times
[2025-03-03 09:50:03,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:03,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749985466]
[2025-03-03 09:50:03,335 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:03,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:03,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 09:50:03,376 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 09:50:03,376 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:03,376 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:03,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:03,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:03,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749985466]
[2025-03-03 09:50:03,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749985466] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:03,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880560920]
[2025-03-03 09:50:03,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:03,628 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:03,628 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:03,630 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-03 09:50:03,632 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-03 09:50:03,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 09:50:03,752 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 09:50:03,753 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:03,753 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:03,756 INFO  L256         TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:03,766 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:04,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-03-03 09:50:04,019 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:04,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [880560920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:04,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:04,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 09:50:04,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975152061]
[2025-03-03 09:50:04,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:04,020 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:04,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:04,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:04,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:04,021 INFO  L87              Difference]: Start difference. First operand 4145 states and 5110 transitions. Second operand  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-03 09:50:04,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:04,620 INFO  L93              Difference]: Finished difference Result 12395 states and 15287 transitions.
[2025-03-03 09:50:04,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:04,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228
[2025-03-03 09:50:04,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:04,645 INFO  L225             Difference]: With dead ends: 12395
[2025-03-03 09:50:04,645 INFO  L226             Difference]: Without dead ends: 8252
[2025-03-03 09:50:04,651 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:04,652 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:04,653 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 78 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:04,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8252 states.
[2025-03-03 09:50:04,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 8247.
[2025-03-03 09:50:04,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8247 states, 8246 states have (on average 1.208464710162503) internal successors, (9965), 8246 states have internal predecessors, (9965), 0 states have call successors, (0), 0 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-03 09:50:04,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 9965 transitions.
[2025-03-03 09:50:04,797 INFO  L78                 Accepts]: Start accepts. Automaton has 8247 states and 9965 transitions. Word has length 228
[2025-03-03 09:50:04,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:04,797 INFO  L471      AbstractCegarLoop]: Abstraction has 8247 states and 9965 transitions.
[2025-03-03 09:50:04,798 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-03 09:50:04,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 8247 states and 9965 transitions.
[2025-03-03 09:50:04,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 09:50:04,806 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:04,806 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:04,815 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:05,007 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:05,007 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:05,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:05,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -605504515, now seen corresponding path program 1 times
[2025-03-03 09:50:05,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:05,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853152762]
[2025-03-03 09:50:05,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:05,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:05,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 09:50:05,046 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 09:50:05,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:05,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:05,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:05,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:05,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853152762]
[2025-03-03 09:50:05,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853152762] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:05,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162494657]
[2025-03-03 09:50:05,769 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:05,769 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:05,769 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:05,771 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-03 09:50:05,772 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-03 09:50:05,851 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 09:50:05,924 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 09:50:05,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:05,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:05,927 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:05,933 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:06,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-03 09:50:06,163 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:06,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [162494657] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:06,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:06,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:06,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526654116]
[2025-03-03 09:50:06,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:06,163 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:06,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:06,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:06,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:06,164 INFO  L87              Difference]: Start difference. First operand 8247 states and 9965 transitions. Second operand  has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-03 09:50:06,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:06,757 INFO  L93              Difference]: Finished difference Result 16510 states and 19958 transitions.
[2025-03-03 09:50:06,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:06,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-03-03 09:50:06,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:06,785 INFO  L225             Difference]: With dead ends: 16510
[2025-03-03 09:50:06,786 INFO  L226             Difference]: Without dead ends: 8265
[2025-03-03 09:50:06,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:06,795 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:06,796 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 332 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:06,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8265 states.
[2025-03-03 09:50:06,919 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 8247.
[2025-03-03 09:50:06,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8247 states, 8246 states have (on average 1.201188455008489) internal successors, (9905), 8246 states have internal predecessors, (9905), 0 states have call successors, (0), 0 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-03 09:50:06,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 9905 transitions.
[2025-03-03 09:50:06,947 INFO  L78                 Accepts]: Start accepts. Automaton has 8247 states and 9905 transitions. Word has length 231
[2025-03-03 09:50:06,948 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:06,948 INFO  L471      AbstractCegarLoop]: Abstraction has 8247 states and 9905 transitions.
[2025-03-03 09:50:06,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-03 09:50:06,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 8247 states and 9905 transitions.
[2025-03-03 09:50:06,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2025-03-03 09:50:06,961 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:06,961 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:06,968 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:07,166 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,SelfDestructingSolverStorable7
[2025-03-03 09:50:07,167 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:07,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:07,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 1249071746, now seen corresponding path program 1 times
[2025-03-03 09:50:07,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:07,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381642013]
[2025-03-03 09:50:07,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:07,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:07,206 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-03-03 09:50:07,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-03-03 09:50:07,215 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:07,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:07,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:07,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:07,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381642013]
[2025-03-03 09:50:07,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381642013] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:07,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624749492]
[2025-03-03 09:50:07,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:07,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:07,905 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:07,910 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:07,913 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 09:50:07,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-03-03 09:50:08,019 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-03-03 09:50:08,019 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:08,019 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:08,021 INFO  L256         TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:08,025 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:08,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:08,048 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:08,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624749492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:08,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:08,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:08,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024583459]
[2025-03-03 09:50:08,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:08,049 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:08,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:08,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:08,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:08,050 INFO  L87              Difference]: Start difference. First operand 8247 states and 9905 transitions. Second operand  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:08,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:08,641 INFO  L93              Difference]: Finished difference Result 20564 states and 25238 transitions.
[2025-03-03 09:50:08,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:08,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237
[2025-03-03 09:50:08,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:08,663 INFO  L225             Difference]: With dead ends: 20564
[2025-03-03 09:50:08,663 INFO  L226             Difference]: Without dead ends: 12319
[2025-03-03 09:50:08,672 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:08,673 INFO  L435           NwaCegarLoop]: 312 mSDtfsCounter, 213 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:08,673 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 332 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:08,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12319 states.
[2025-03-03 09:50:08,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12319 to 12307.
[2025-03-03 09:50:08,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12307 states, 12306 states have (on average 1.1590281163660003) internal successors, (14263), 12306 states have internal predecessors, (14263), 0 states have call successors, (0), 0 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-03 09:50:08,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12307 states to 12307 states and 14263 transitions.
[2025-03-03 09:50:08,874 INFO  L78                 Accepts]: Start accepts. Automaton has 12307 states and 14263 transitions. Word has length 237
[2025-03-03 09:50:08,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:08,874 INFO  L471      AbstractCegarLoop]: Abstraction has 12307 states and 14263 transitions.
[2025-03-03 09:50:08,875 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:08,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 12307 states and 14263 transitions.
[2025-03-03 09:50:08,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-03-03 09:50:08,887 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:08,887 INFO  L218           NwaCegarLoop]: trace histogram [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, 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]
[2025-03-03 09:50:08,894 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 09:50:09,087 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:09,088 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:09,088 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:09,088 INFO  L85        PathProgramCache]: Analyzing trace with hash -720017988, now seen corresponding path program 1 times
[2025-03-03 09:50:09,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:09,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88395215]
[2025-03-03 09:50:09,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:09,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:09,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-03-03 09:50:09,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-03-03 09:50:09,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:09,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:09,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-03-03 09:50:09,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:09,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88395215]
[2025-03-03 09:50:09,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88395215] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:09,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897745990]
[2025-03-03 09:50:09,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:09,807 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:09,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:09,810 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:09,813 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 09:50:09,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-03-03 09:50:09,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-03-03 09:50:09,920 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:09,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:09,923 INFO  L256         TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:09,926 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:09,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:09,997 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:09,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897745990] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:09,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:09,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:09,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100394194]
[2025-03-03 09:50:09,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:10,000 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:10,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:10,001 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:10,002 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:10,002 INFO  L87              Difference]: Start difference. First operand 12307 states and 14263 transitions. Second operand  has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:10,552 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:10,553 INFO  L93              Difference]: Finished difference Result 36816 states and 42655 transitions.
[2025-03-03 09:50:10,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:10,553 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259
[2025-03-03 09:50:10,553 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:10,583 INFO  L225             Difference]: With dead ends: 36816
[2025-03-03 09:50:10,583 INFO  L226             Difference]: Without dead ends: 24511
[2025-03-03 09:50:10,597 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:10,597 INFO  L435           NwaCegarLoop]: 277 mSDtfsCounter, 211 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:10,598 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 292 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:10,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24511 states.
[2025-03-03 09:50:10,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24511 to 24499.
[2025-03-03 09:50:10,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24499 states, 24498 states have (on average 1.1256429096252756) internal successors, (27576), 24498 states have internal predecessors, (27576), 0 states have call successors, (0), 0 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-03 09:50:10,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24499 states to 24499 states and 27576 transitions.
[2025-03-03 09:50:10,864 INFO  L78                 Accepts]: Start accepts. Automaton has 24499 states and 27576 transitions. Word has length 259
[2025-03-03 09:50:10,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:10,864 INFO  L471      AbstractCegarLoop]: Abstraction has 24499 states and 27576 transitions.
[2025-03-03 09:50:10,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:10,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 24499 states and 27576 transitions.
[2025-03-03 09:50:10,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2025-03-03 09:50:10,879 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:10,879 INFO  L218           NwaCegarLoop]: trace histogram [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, 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]
[2025-03-03 09:50:10,886 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:11,079 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:11,080 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:11,080 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:11,080 INFO  L85        PathProgramCache]: Analyzing trace with hash 478830091, now seen corresponding path program 1 times
[2025-03-03 09:50:11,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:11,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778930592]
[2025-03-03 09:50:11,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:11,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:11,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes.
[2025-03-03 09:50:11,110 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements.
[2025-03-03 09:50:11,111 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:11,111 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:11,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-03-03 09:50:11,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:11,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778930592]
[2025-03-03 09:50:11,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778930592] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:11,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526857184]
[2025-03-03 09:50:11,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:11,863 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:11,864 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:11,865 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:11,867 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 09:50:11,922 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes.
[2025-03-03 09:50:11,981 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements.
[2025-03-03 09:50:11,981 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:11,981 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:11,983 INFO  L256         TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:11,986 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:12,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-03-03 09:50:12,170 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:12,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [526857184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:12,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:12,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:12,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668031525]
[2025-03-03 09:50:12,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:12,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:12,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:12,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:12,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:12,171 INFO  L87              Difference]: Start difference. First operand 24499 states and 27576 transitions. Second operand  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:12,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:12,822 INFO  L93              Difference]: Finished difference Result 69355 states and 78140 transitions.
[2025-03-03 09:50:12,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:12,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265
[2025-03-03 09:50:12,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:12,896 INFO  L225             Difference]: With dead ends: 69355
[2025-03-03 09:50:12,897 INFO  L226             Difference]: Without dead ends: 44858
[2025-03-03 09:50:12,925 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:12,926 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:12,926 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:12,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44858 states.
[2025-03-03 09:50:13,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44858 to 33029.
[2025-03-03 09:50:13,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33029 states, 33028 states have (on average 1.1395482620806587) internal successors, (37637), 33028 states have internal predecessors, (37637), 0 states have call successors, (0), 0 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-03 09:50:13,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33029 states to 33029 states and 37637 transitions.
[2025-03-03 09:50:13,384 INFO  L78                 Accepts]: Start accepts. Automaton has 33029 states and 37637 transitions. Word has length 265
[2025-03-03 09:50:13,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:13,384 INFO  L471      AbstractCegarLoop]: Abstraction has 33029 states and 37637 transitions.
[2025-03-03 09:50:13,384 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:13,385 INFO  L276                IsEmpty]: Start isEmpty. Operand 33029 states and 37637 transitions.
[2025-03-03 09:50:13,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2025-03-03 09:50:13,407 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:13,408 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:13,415 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:13,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-03-03 09:50:13,609 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:13,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:13,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -164092291, now seen corresponding path program 1 times
[2025-03-03 09:50:13,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:13,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539510929]
[2025-03-03 09:50:13,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:13,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:13,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes.
[2025-03-03 09:50:13,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements.
[2025-03-03 09:50:13,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:13,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:13,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:13,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:13,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539510929]
[2025-03-03 09:50:13,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539510929] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:13,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:13,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:13,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089044341]
[2025-03-03 09:50:13,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:13,724 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:13,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:13,724 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:13,724 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:13,725 INFO  L87              Difference]: Start difference. First operand 33029 states and 37637 transitions. Second operand  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-03 09:50:14,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:14,435 INFO  L93              Difference]: Finished difference Result 81747 states and 93669 transitions.
[2025-03-03 09:50:14,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:14,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 271
[2025-03-03 09:50:14,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:14,503 INFO  L225             Difference]: With dead ends: 81747
[2025-03-03 09:50:14,503 INFO  L226             Difference]: Without dead ends: 48720
[2025-03-03 09:50:14,517 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-03 09:50:14,517 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 223 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:14,518 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 305 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:50:14,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48720 states.
[2025-03-03 09:50:14,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48720 to 48700.
[2025-03-03 09:50:14,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48700 states, 48699 states have (on average 1.1359986858046367) internal successors, (55322), 48699 states have internal predecessors, (55322), 0 states have call successors, (0), 0 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-03 09:50:14,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48700 states to 48700 states and 55322 transitions.
[2025-03-03 09:50:14,995 INFO  L78                 Accepts]: Start accepts. Automaton has 48700 states and 55322 transitions. Word has length 271
[2025-03-03 09:50:14,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:14,995 INFO  L471      AbstractCegarLoop]: Abstraction has 48700 states and 55322 transitions.
[2025-03-03 09:50:14,995 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-03 09:50:14,995 INFO  L276                IsEmpty]: Start isEmpty. Operand 48700 states and 55322 transitions.
[2025-03-03 09:50:15,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2025-03-03 09:50:15,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:15,020 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:15,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 09:50:15,021 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:15,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:15,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -280403092, now seen corresponding path program 1 times
[2025-03-03 09:50:15,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:15,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367898980]
[2025-03-03 09:50:15,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:15,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:15,052 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes.
[2025-03-03 09:50:15,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements.
[2025-03-03 09:50:15,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:15,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:15,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked.
[2025-03-03 09:50:15,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:15,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367898980]
[2025-03-03 09:50:15,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367898980] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:15,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152873396]
[2025-03-03 09:50:15,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:15,317 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:15,317 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:15,319 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:15,321 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 09:50:15,390 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes.
[2025-03-03 09:50:15,464 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements.
[2025-03-03 09:50:15,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:15,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:15,467 INFO  L256         TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:15,477 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:15,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-03-03 09:50:15,491 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:15,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152873396] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:15,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:15,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:15,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393559352]
[2025-03-03 09:50:15,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:15,492 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:15,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:15,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:15,493 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:15,493 INFO  L87              Difference]: Start difference. First operand 48700 states and 55322 transitions. Second operand  has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-03 09:50:16,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:16,264 INFO  L93              Difference]: Finished difference Result 109793 states and 126102 transitions.
[2025-03-03 09:50:16,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:16,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 290
[2025-03-03 09:50:16,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:16,328 INFO  L225             Difference]: With dead ends: 109793
[2025-03-03 09:50:16,328 INFO  L226             Difference]: Without dead ends: 61095
[2025-03-03 09:50:16,347 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:16,348 INFO  L435           NwaCegarLoop]: 95 mSDtfsCounter, 219 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:16,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 114 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:50:16,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61095 states.
[2025-03-03 09:50:17,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61095 to 60068.
[2025-03-03 09:50:17,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60068 states, 60067 states have (on average 1.1158539630745667) internal successors, (67026), 60067 states have internal predecessors, (67026), 0 states have call successors, (0), 0 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-03 09:50:17,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60068 states to 60068 states and 67026 transitions.
[2025-03-03 09:50:17,157 INFO  L78                 Accepts]: Start accepts. Automaton has 60068 states and 67026 transitions. Word has length 290
[2025-03-03 09:50:17,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:17,157 INFO  L471      AbstractCegarLoop]: Abstraction has 60068 states and 67026 transitions.
[2025-03-03 09:50:17,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-03 09:50:17,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 60068 states and 67026 transitions.
[2025-03-03 09:50:17,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 311
[2025-03-03 09:50:17,191 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:17,192 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:17,199 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:17,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:17,392 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:17,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:17,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1752482737, now seen corresponding path program 1 times
[2025-03-03 09:50:17,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:17,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727368465]
[2025-03-03 09:50:17,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:17,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:17,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes.
[2025-03-03 09:50:17,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements.
[2025-03-03 09:50:17,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:17,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:17,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:50:17,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:17,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727368465]
[2025-03-03 09:50:17,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727368465] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:17,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:17,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:17,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032254850]
[2025-03-03 09:50:17,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:17,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:17,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:17,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:17,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:17,706 INFO  L87              Difference]: Start difference. First operand 60068 states and 67026 transitions. Second operand  has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-03 09:50:18,798 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:18,798 INFO  L93              Difference]: Finished difference Result 140504 states and 156889 transitions.
[2025-03-03 09:50:18,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:18,799 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 310
[2025-03-03 09:50:18,799 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:18,891 INFO  L225             Difference]: With dead ends: 140504
[2025-03-03 09:50:18,891 INFO  L226             Difference]: Without dead ends: 80438
[2025-03-03 09:50:18,922 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-03 09:50:18,923 INFO  L435           NwaCegarLoop]: 63 mSDtfsCounter, 464 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:18,923 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 84 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:18,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80438 states.
[2025-03-03 09:50:19,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80438 to 79556.
[2025-03-03 09:50:19,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79556 states, 79555 states have (on average 1.0969015146753818) internal successors, (87264), 79555 states have internal predecessors, (87264), 0 states have call successors, (0), 0 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-03 09:50:19,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79556 states to 79556 states and 87264 transitions.
[2025-03-03 09:50:19,968 INFO  L78                 Accepts]: Start accepts. Automaton has 79556 states and 87264 transitions. Word has length 310
[2025-03-03 09:50:19,968 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:19,968 INFO  L471      AbstractCegarLoop]: Abstraction has 79556 states and 87264 transitions.
[2025-03-03 09:50:19,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-03 09:50:19,969 INFO  L276                IsEmpty]: Start isEmpty. Operand 79556 states and 87264 transitions.
[2025-03-03 09:50:19,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 317
[2025-03-03 09:50:20,000 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:20,000 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:20,000 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 09:50:20,000 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:20,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:20,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -1216788942, now seen corresponding path program 1 times
[2025-03-03 09:50:20,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:20,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805580323]
[2025-03-03 09:50:20,001 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:20,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:20,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-03-03 09:50:20,040 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-03-03 09:50:20,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:20,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:20,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 196 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-03-03 09:50:20,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:20,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805580323]
[2025-03-03 09:50:20,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805580323] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:20,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199107248]
[2025-03-03 09:50:20,257 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:20,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:20,257 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:20,259 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:20,260 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 09:50:20,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-03-03 09:50:20,375 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-03-03 09:50:20,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:20,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:20,377 INFO  L256         TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:20,381 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:20,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 196 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-03-03 09:50:20,692 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:20,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199107248] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:20,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:20,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:20,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284524330]
[2025-03-03 09:50:20,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:20,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:20,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:20,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:20,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:20,694 INFO  L87              Difference]: Start difference. First operand 79556 states and 87264 transitions. Second operand  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-03 09:50:21,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:21,373 INFO  L93              Difference]: Finished difference Result 158513 states and 173883 transitions.
[2025-03-03 09:50:21,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:21,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 316
[2025-03-03 09:50:21,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:21,460 INFO  L225             Difference]: With dead ends: 158513
[2025-03-03 09:50:21,460 INFO  L226             Difference]: Without dead ends: 78959
[2025-03-03 09:50:21,513 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:21,514 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:21,514 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:50:21,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78959 states.
[2025-03-03 09:50:22,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78959 to 76917.
[2025-03-03 09:50:22,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76917 states, 76916 states have (on average 1.0897602579437309) internal successors, (83820), 76916 states have internal predecessors, (83820), 0 states have call successors, (0), 0 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-03 09:50:22,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76917 states to 76917 states and 83820 transitions.
[2025-03-03 09:50:22,608 INFO  L78                 Accepts]: Start accepts. Automaton has 76917 states and 83820 transitions. Word has length 316
[2025-03-03 09:50:22,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:22,608 INFO  L471      AbstractCegarLoop]: Abstraction has 76917 states and 83820 transitions.
[2025-03-03 09:50:22,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-03 09:50:22,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 76917 states and 83820 transitions.
[2025-03-03 09:50:22,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 323
[2025-03-03 09:50:22,647 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:22,647 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:22,654 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 09:50:22,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:22,848 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:22,849 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:22,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 730884005, now seen corresponding path program 1 times
[2025-03-03 09:50:22,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:22,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748490800]
[2025-03-03 09:50:22,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:22,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:23,016 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes.
[2025-03-03 09:50:23,031 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements.
[2025-03-03 09:50:23,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:23,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:23,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:23,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:23,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748490800]
[2025-03-03 09:50:23,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748490800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:23,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:23,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:23,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854322638]
[2025-03-03 09:50:23,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:23,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:23,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:23,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:23,108 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:23,108 INFO  L87              Difference]: Start difference. First operand 76917 states and 83820 transitions. Second operand  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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-03 09:50:23,798 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:23,799 INFO  L93              Difference]: Finished difference Result 144040 states and 157109 transitions.
[2025-03-03 09:50:23,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:23,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 322
[2025-03-03 09:50:23,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:23,879 INFO  L225             Difference]: With dead ends: 144040
[2025-03-03 09:50:23,880 INFO  L226             Difference]: Without dead ends: 67125
[2025-03-03 09:50:23,927 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-03 09:50:23,928 INFO  L435           NwaCegarLoop]: 297 mSDtfsCounter, 210 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:23,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 312 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:50:23,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67125 states.
[2025-03-03 09:50:24,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67125 to 66104.
[2025-03-03 09:50:24,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66104 states, 66103 states have (on average 1.0715096137845483) internal successors, (70830), 66103 states have internal predecessors, (70830), 0 states have call successors, (0), 0 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-03 09:50:24,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66104 states to 66104 states and 70830 transitions.
[2025-03-03 09:50:24,889 INFO  L78                 Accepts]: Start accepts. Automaton has 66104 states and 70830 transitions. Word has length 322
[2025-03-03 09:50:24,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:24,889 INFO  L471      AbstractCegarLoop]: Abstraction has 66104 states and 70830 transitions.
[2025-03-03 09:50:24,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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-03 09:50:24,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 66104 states and 70830 transitions.
[2025-03-03 09:50:24,909 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-03-03 09:50:24,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:24,909 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:24,910 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 09:50:24,910 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:24,910 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:24,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 595452885, now seen corresponding path program 1 times
[2025-03-03 09:50:24,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:24,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485692036]
[2025-03-03 09:50:24,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:24,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:24,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-03 09:50:24,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-03 09:50:24,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:24,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:25,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2025-03-03 09:50:25,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:25,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485692036]
[2025-03-03 09:50:25,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485692036] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:25,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362165948]
[2025-03-03 09:50:25,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:25,989 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:25,989 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:25,991 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:25,992 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-03 09:50:26,051 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-03 09:50:26,115 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-03 09:50:26,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:26,115 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:26,117 INFO  L256         TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:26,121 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:26,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 145 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:26,257 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:50:26,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 145 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:26,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [362165948] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:50:26,391 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:50:26,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6
[2025-03-03 09:50:26,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480735378]
[2025-03-03 09:50:26,391 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:50:26,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 09:50:26,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:26,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 09:50:26,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:50:26,393 INFO  L87              Difference]: Start difference. First operand 66104 states and 70830 transitions. Second operand  has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 0 states have call successors, (0), 0 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-03 09:50:28,132 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:28,132 INFO  L93              Difference]: Finished difference Result 185307 states and 198862 transitions.
[2025-03-03 09:50:28,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 09:50:28,133 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 0 states have call successors, (0), 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 339
[2025-03-03 09:50:28,133 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:28,276 INFO  L225             Difference]: With dead ends: 185307
[2025-03-03 09:50:28,276 INFO  L226             Difference]: Without dead ends: 119205
[2025-03-03 09:50:28,336 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:50:28,336 INFO  L435           NwaCegarLoop]: 42 mSDtfsCounter, 1756 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:28,336 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 144 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 09:50:28,426 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119205 states.
[2025-03-03 09:50:29,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119205 to 118365.
[2025-03-03 09:50:29,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118365 states, 118364 states have (on average 1.072716366462776) internal successors, (126971), 118364 states have internal predecessors, (126971), 0 states have call successors, (0), 0 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-03 09:50:29,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118365 states to 118365 states and 126971 transitions.
[2025-03-03 09:50:29,874 INFO  L78                 Accepts]: Start accepts. Automaton has 118365 states and 126971 transitions. Word has length 339
[2025-03-03 09:50:29,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:29,874 INFO  L471      AbstractCegarLoop]: Abstraction has 118365 states and 126971 transitions.
[2025-03-03 09:50:29,874 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 6 states have internal predecessors, (374), 0 states have call successors, (0), 0 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-03 09:50:29,874 INFO  L276                IsEmpty]: Start isEmpty. Operand 118365 states and 126971 transitions.
[2025-03-03 09:50:29,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 445
[2025-03-03 09:50:29,929 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:29,929 INFO  L218           NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:50:29,935 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:30,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-03 09:50:30,130 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:30,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:30,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -71380164, now seen corresponding path program 1 times
[2025-03-03 09:50:30,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:30,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709944928]
[2025-03-03 09:50:30,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:30,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:30,179 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes.
[2025-03-03 09:50:30,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements.
[2025-03-03 09:50:30,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:30,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:30,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 500 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked.
[2025-03-03 09:50:30,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:30,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709944928]
[2025-03-03 09:50:30,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709944928] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:30,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15919503]
[2025-03-03 09:50:30,766 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:30,766 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:30,766 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:30,768 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:30,770 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-03-03 09:50:30,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes.
[2025-03-03 09:50:30,937 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements.
[2025-03-03 09:50:30,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:30,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:30,940 INFO  L256         TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:30,946 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:31,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 500 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked.
[2025-03-03 09:50:31,145 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:31,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [15919503] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:31,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:31,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 09:50:31,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666280093]
[2025-03-03 09:50:31,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:31,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:31,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:31,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:31,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:31,147 INFO  L87              Difference]: Start difference. First operand 118365 states and 126971 transitions. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-03 09:50:32,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:32,233 INFO  L93              Difference]: Finished difference Result 235133 states and 252298 transitions.
[2025-03-03 09:50:32,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:32,234 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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 444
[2025-03-03 09:50:32,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:32,396 INFO  L225             Difference]: With dead ends: 235133
[2025-03-03 09:50:32,397 INFO  L226             Difference]: Without dead ends: 117988
[2025-03-03 09:50:32,484 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:32,484 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:32,485 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 75 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:32,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117988 states.
[2025-03-03 09:50:34,205 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117988 to 114301.
[2025-03-03 09:50:34,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114301 states, 114300 states have (on average 1.0561154855643045) internal successors, (120714), 114300 states have internal predecessors, (120714), 0 states have call successors, (0), 0 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-03 09:50:34,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114301 states to 114301 states and 120714 transitions.
[2025-03-03 09:50:34,414 INFO  L78                 Accepts]: Start accepts. Automaton has 114301 states and 120714 transitions. Word has length 444
[2025-03-03 09:50:34,415 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:34,415 INFO  L471      AbstractCegarLoop]: Abstraction has 114301 states and 120714 transitions.
[2025-03-03 09:50:34,415 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-03 09:50:34,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 114301 states and 120714 transitions.
[2025-03-03 09:50:34,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 475
[2025-03-03 09:50:34,474 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:34,474 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 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, 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, 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]
[2025-03-03 09:50:34,481 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-03-03 09:50:34,674 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 09:50:34,675 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:34,675 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:34,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -697864732, now seen corresponding path program 1 times
[2025-03-03 09:50:34,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:34,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81997566]
[2025-03-03 09:50:34,675 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:34,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:34,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes.
[2025-03-03 09:50:34,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements.
[2025-03-03 09:50:34,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:34,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:35,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 742 backedges. 177 proven. 6 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked.
[2025-03-03 09:50:35,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:35,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81997566]
[2025-03-03 09:50:35,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81997566] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:35,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295806657]
[2025-03-03 09:50:35,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:35,297 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:35,297 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:35,299 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:35,353 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 09:50:35,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes.
[2025-03-03 09:50:35,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements.
[2025-03-03 09:50:35,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:35,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:35,545 INFO  L256         TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:35,549 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:35,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 742 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked.
[2025-03-03 09:50:35,563 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:35,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295806657] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:35,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:35,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:35,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842096927]
[2025-03-03 09:50:35,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:35,564 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:35,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:35,564 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:35,564 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:35,565 INFO  L87              Difference]: Start difference. First operand 114301 states and 120714 transitions. Second operand  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-03 09:50:36,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:36,301 INFO  L93              Difference]: Finished difference Result 313967 states and 331213 transitions.
[2025-03-03 09:50:36,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:36,302 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 474
[2025-03-03 09:50:36,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:36,541 INFO  L225             Difference]: With dead ends: 313967
[2025-03-03 09:50:36,542 INFO  L226             Difference]: Without dead ends: 200886
[2025-03-03 09:50:36,635 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:36,635 INFO  L435           NwaCegarLoop]: 554 mSDtfsCounter, 277 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:36,635 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 796 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:50:36,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200886 states.
[2025-03-03 09:50:38,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200886 to 189107.
[2025-03-03 09:50:39,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189107 states, 189106 states have (on average 1.0519708523262086) internal successors, (198934), 189106 states have internal predecessors, (198934), 0 states have call successors, (0), 0 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-03 09:50:39,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189107 states to 189107 states and 198934 transitions.
[2025-03-03 09:50:39,604 INFO  L78                 Accepts]: Start accepts. Automaton has 189107 states and 198934 transitions. Word has length 474
[2025-03-03 09:50:39,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:39,605 INFO  L471      AbstractCegarLoop]: Abstraction has 189107 states and 198934 transitions.
[2025-03-03 09:50:39,605 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-03 09:50:39,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 189107 states and 198934 transitions.
[2025-03-03 09:50:39,684 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 490
[2025-03-03 09:50:39,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:39,685 INFO  L218           NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 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]
[2025-03-03 09:50:39,691 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-03-03 09:50:39,885 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:39,885 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:39,886 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:39,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 1308049722, now seen corresponding path program 1 times
[2025-03-03 09:50:39,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:39,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872988344]
[2025-03-03 09:50:39,886 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:39,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:39,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-03-03 09:50:39,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-03-03 09:50:39,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:39,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:40,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 738 backedges. 170 proven. 6 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked.
[2025-03-03 09:50:40,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:40,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872988344]
[2025-03-03 09:50:40,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872988344] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:40,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403120462]
[2025-03-03 09:50:40,420 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:40,420 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:40,420 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:40,423 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:40,424 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-03-03 09:50:40,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-03-03 09:50:40,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-03-03 09:50:40,653 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:40,653 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:40,657 INFO  L256         TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:40,663 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:40,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 738 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked.
[2025-03-03 09:50:40,764 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:40,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403120462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:40,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:40,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:40,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934323094]
[2025-03-03 09:50:40,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:40,765 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:40,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:40,766 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:40,766 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:40,766 INFO  L87              Difference]: Start difference. First operand 189107 states and 198934 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:42,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:42,603 INFO  L93              Difference]: Finished difference Result 491435 states and 517364 transitions.
[2025-03-03 09:50:42,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:42,603 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 489
[2025-03-03 09:50:42,603 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:43,277 INFO  L225             Difference]: With dead ends: 491435
[2025-03-03 09:50:43,277 INFO  L226             Difference]: Without dead ends: 303548
[2025-03-03 09:50:43,339 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:43,340 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 485 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:43,340 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 295 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:43,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 303548 states.
[2025-03-03 09:50:46,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 303548 to 286889.
[2025-03-03 09:50:46,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 286889 states, 286888 states have (on average 1.0532890884247512) internal successors, (302176), 286888 states have internal predecessors, (302176), 0 states have call successors, (0), 0 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-03 09:50:47,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 286889 states to 286889 states and 302176 transitions.
[2025-03-03 09:50:47,191 INFO  L78                 Accepts]: Start accepts. Automaton has 286889 states and 302176 transitions. Word has length 489
[2025-03-03 09:50:47,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:47,191 INFO  L471      AbstractCegarLoop]: Abstraction has 286889 states and 302176 transitions.
[2025-03-03 09:50:47,191 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:47,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 286889 states and 302176 transitions.
[2025-03-03 09:50:47,282 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2025-03-03 09:50:47,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:47,283 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:50:47,290 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-03-03 09:50:47,483 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:47,483 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:47,484 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:47,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 429578174, now seen corresponding path program 1 times
[2025-03-03 09:50:47,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:47,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364109523]
[2025-03-03 09:50:47,484 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:47,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:47,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes.
[2025-03-03 09:50:47,548 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements.
[2025-03-03 09:50:47,549 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:47,549 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:47,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 642 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked.
[2025-03-03 09:50:47,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:47,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364109523]
[2025-03-03 09:50:47,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364109523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:47,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:47,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:47,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142507991]
[2025-03-03 09:50:47,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:47,943 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:47,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:47,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:47,943 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:47,943 INFO  L87              Difference]: Start difference. First operand 286889 states and 302176 transitions. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-03 09:50:49,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:49,707 INFO  L93              Difference]: Finished difference Result 564605 states and 594433 transitions.
[2025-03-03 09:50:49,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:49,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 496
[2025-03-03 09:50:49,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:50,047 INFO  L225             Difference]: With dead ends: 564605
[2025-03-03 09:50:50,048 INFO  L226             Difference]: Without dead ends: 278936
[2025-03-03 09:50:50,154 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-03 09:50:50,154 INFO  L435           NwaCegarLoop]: 82 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:50,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 98 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:50:50,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 278936 states.