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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label50.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 40dac47caceafe03bc0ffa25ad5f74a6ba08287baf5277ee6c97f2f17e5210aa
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 14:11:57,741 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 14:11:57,788 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 14:11:57,793 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 14:11:57,793 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 14:11:57,808 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 14:11:57,808 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 14:11:57,808 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 14:11:57,808 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 14:11:57,808 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 14:11:57,810 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 14:11:57,810 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 14:11:57,810 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 14:11:57,810 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 14:11:57,811 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 14:11:57,811 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 14:11:57,811 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 14:11:57,811 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 14:11:57,812 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 14:11:57,812 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:11:57,813 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 14:11:57,813 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 14:11:57,814 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 14:11:57,814 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 14:11:57,814 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 14:11:57,814 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 14:11:57,814 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 14:11:57,814 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 -> 40dac47caceafe03bc0ffa25ad5f74a6ba08287baf5277ee6c97f2f17e5210aa
[2025-03-16 14:11:58,039 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 14:11:58,046 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 14:11:58,048 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 14:11:58,049 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 14:11:58,049 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 14:11:58,051 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label50.c
[2025-03-16 14:11:59,223 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe432cbd/e4dc7c5dc36a404987b08f591620a2c9/FLAG8a8108841
[2025-03-16 14:11:59,630 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 14:11:59,632 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label50.c
[2025-03-16 14:11:59,648 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe432cbd/e4dc7c5dc36a404987b08f591620a2c9/FLAG8a8108841
[2025-03-16 14:11:59,666 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe432cbd/e4dc7c5dc36a404987b08f591620a2c9
[2025-03-16 14:11:59,669 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 14:11:59,670 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 14:11:59,671 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 14:11:59,671 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 14:11:59,675 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 14:11:59,676 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:59" (1/1) ...
[2025-03-16 14:11:59,678 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:59, skipping insertion in model container
[2025-03-16 14:11:59,678 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:59" (1/1) ...
[2025-03-16 14:11:59,727 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 14:12:00,089 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_label50.c[55003,55016]
[2025-03-16 14:12:00,119 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:12:00,127 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 14:12:00,245 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_label50.c[55003,55016]
[2025-03-16 14:12:00,260 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:12:00,274 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 14:12:00,275 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00 WrapperNode
[2025-03-16 14:12:00,276 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 14:12:00,277 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 14:12:00,277 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 14:12:00,277 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 14:12:00,282 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,306 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,395 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-16 14:12:00,396 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 14:12:00,397 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 14:12:00,397 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 14:12:00,397 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 14:12:00,403 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,403 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,410 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,435 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-16 14:12:00,440 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,440 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,472 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,477 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,486 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,490 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,499 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 14:12:00,500 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 14:12:00,500 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 14:12:00,501 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 14:12:00,501 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (1/1) ...
[2025-03-16 14:12:00,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:12:00,514 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:00,525 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 14:12:00,528 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 14:12:00,545 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 14:12:00,546 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 14:12:00,546 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 14:12:00,546 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 14:12:00,606 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 14:12:00,607 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 14:12:01,964 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-16 14:12:01,964 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 14:12:01,979 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 14:12:01,981 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 14:12:01,981 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:01 BoogieIcfgContainer
[2025-03-16 14:12:01,981 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 14:12:01,983 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 14:12:01,984 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 14:12:01,987 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 14:12:01,988 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:59" (1/3) ...
[2025-03-16 14:12:01,988 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4cb92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:01, skipping insertion in model container
[2025-03-16 14:12:01,988 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:00" (2/3) ...
[2025-03-16 14:12:01,989 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4cb92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:01, skipping insertion in model container
[2025-03-16 14:12:01,989 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:01" (3/3) ...
[2025-03-16 14:12:01,990 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label50.c
[2025-03-16 14:12:02,002 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 14:12:02,005 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label50.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 14:12:02,058 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 14:12:02,068 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;@6ffeb054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 14:12:02,069 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 14:12:02,072 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:02,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-03-16 14:12:02,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:02,085 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:02,086 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:02,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:02,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335738180, now seen corresponding path program 1 times
[2025-03-16 14:12:02,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:02,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089083473]
[2025-03-16 14:12:02,097 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:02,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:02,195 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-03-16 14:12:02,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-03-16 14:12:02,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:02,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:02,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:02,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:02,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089083473]
[2025-03-16 14:12:02,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089083473] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:02,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:02,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:02,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795000768]
[2025-03-16 14:12:02,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:02,540 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 14:12:02,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:02,557 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 14:12:02,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:12:02,560 INFO  L87              Difference]: Start difference. First operand  has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:02,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:02,599 INFO  L93              Difference]: Finished difference Result 481 states and 913 transitions.
[2025-03-16 14:12:02,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 14:12:02,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 153
[2025-03-16 14:12:02,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:02,609 INFO  L225             Difference]: With dead ends: 481
[2025-03-16 14:12:02,609 INFO  L226             Difference]: Without dead ends: 238
[2025-03-16 14:12:02,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:12:02,614 INFO  L435           NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:02,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 14:12:02,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2025-03-16 14:12:02,643 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238.
[2025-03-16 14:12:02,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:02,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions.
[2025-03-16 14:12:02,650 INFO  L78                 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 153
[2025-03-16 14:12:02,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:02,651 INFO  L471      AbstractCegarLoop]: Abstraction has 238 states and 392 transitions.
[2025-03-16 14:12:02,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:02,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions.
[2025-03-16 14:12:02,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-03-16 14:12:02,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:02,654 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]
[2025-03-16 14:12:02,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 14:12:02,654 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:02,656 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:02,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947289948, now seen corresponding path program 1 times
[2025-03-16 14:12:02,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:02,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211780029]
[2025-03-16 14:12:02,656 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:02,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:02,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-03-16 14:12:02,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-03-16 14:12:02,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:02,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:03,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:03,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:03,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211780029]
[2025-03-16 14:12:03,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211780029] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:03,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:03,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:03,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039413363]
[2025-03-16 14:12:03,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:03,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:03,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:03,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:03,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:03,096 INFO  L87              Difference]: Start difference. First operand 238 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:03,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:03,789 INFO  L93              Difference]: Finished difference Result 701 states and 1160 transitions.
[2025-03-16 14:12:03,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:03,790 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 153
[2025-03-16 14:12:03,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:03,792 INFO  L225             Difference]: With dead ends: 701
[2025-03-16 14:12:03,792 INFO  L226             Difference]: Without dead ends: 464
[2025-03-16 14:12:03,796 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:03,797 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 118 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:03,798 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 14:12:03,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 464 states.
[2025-03-16 14:12:03,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458.
[2025-03-16 14:12:03,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:03,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions.
[2025-03-16 14:12:03,821 INFO  L78                 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 153
[2025-03-16 14:12:03,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:03,821 INFO  L471      AbstractCegarLoop]: Abstraction has 458 states and 712 transitions.
[2025-03-16 14:12:03,821 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:03,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions.
[2025-03-16 14:12:03,826 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-16 14:12:03,826 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:03,826 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]
[2025-03-16 14:12:03,826 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 14:12:03,826 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:03,827 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:03,827 INFO  L85        PathProgramCache]: Analyzing trace with hash 1828845422, now seen corresponding path program 1 times
[2025-03-16 14:12:03,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:03,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257482752]
[2025-03-16 14:12:03,827 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:03,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:03,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-16 14:12:03,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-16 14:12:03,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:03,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:03,982 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-16 14:12:03,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:03,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257482752]
[2025-03-16 14:12:03,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257482752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:03,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:03,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:03,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267585663]
[2025-03-16 14:12:03,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:03,983 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:03,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:03,983 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:03,983 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:03,984 INFO  L87              Difference]: Start difference. First operand 458 states and 712 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:04,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:04,608 INFO  L93              Difference]: Finished difference Result 1342 states and 2101 transitions.
[2025-03-16 14:12:04,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:04,609 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161
[2025-03-16 14:12:04,609 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:04,612 INFO  L225             Difference]: With dead ends: 1342
[2025-03-16 14:12:04,612 INFO  L226             Difference]: Without dead ends: 885
[2025-03-16 14:12:04,613 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:04,613 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 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.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:04,614 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:04,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 885 states.
[2025-03-16 14:12:04,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867.
[2025-03-16 14:12:04,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 867 states, 866 states have (on average 1.533487297921478) internal successors, (1328), 866 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:04,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1328 transitions.
[2025-03-16 14:12:04,633 INFO  L78                 Accepts]: Start accepts. Automaton has 867 states and 1328 transitions. Word has length 161
[2025-03-16 14:12:04,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:04,633 INFO  L471      AbstractCegarLoop]: Abstraction has 867 states and 1328 transitions.
[2025-03-16 14:12:04,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:04,634 INFO  L276                IsEmpty]: Start isEmpty. Operand 867 states and 1328 transitions.
[2025-03-16 14:12:04,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-03-16 14:12:04,636 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:04,636 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-16 14:12:04,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 14:12:04,637 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:04,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:04,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 667537866, now seen corresponding path program 1 times
[2025-03-16 14:12:04,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:04,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194090037]
[2025-03-16 14:12:04,638 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:04,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:04,673 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-16 14:12:04,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-16 14:12:04,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:04,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:04,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:04,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:04,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194090037]
[2025-03-16 14:12:04,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194090037] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:04,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:04,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:04,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700385073]
[2025-03-16 14:12:04,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:04,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:04,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:04,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:04,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:04,778 INFO  L87              Difference]: Start difference. First operand 867 states and 1328 transitions. Second operand  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:05,097 INFO  L93              Difference]: Finished difference Result 1709 states and 2621 transitions.
[2025-03-16 14:12:05,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:05,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166
[2025-03-16 14:12:05,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:05,100 INFO  L225             Difference]: With dead ends: 1709
[2025-03-16 14:12:05,100 INFO  L226             Difference]: Without dead ends: 843
[2025-03-16 14:12:05,101 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:05,102 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:05,102 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:12:05,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 843 states.
[2025-03-16 14:12:05,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843.
[2025-03-16 14:12:05,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 843 states, 842 states have (on average 1.477434679334917) internal successors, (1244), 842 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1244 transitions.
[2025-03-16 14:12:05,115 INFO  L78                 Accepts]: Start accepts. Automaton has 843 states and 1244 transitions. Word has length 166
[2025-03-16 14:12:05,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:05,115 INFO  L471      AbstractCegarLoop]: Abstraction has 843 states and 1244 transitions.
[2025-03-16 14:12:05,115 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 843 states and 1244 transitions.
[2025-03-16 14:12:05,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-03-16 14:12:05,117 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:05,117 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-03-16 14:12:05,118 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 14:12:05,118 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:05,118 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:05,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -580719834, now seen corresponding path program 1 times
[2025-03-16 14:12:05,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:05,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503271889]
[2025-03-16 14:12:05,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:05,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:05,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-03-16 14:12:05,144 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-03-16 14:12:05,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:05,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:05,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-03-16 14:12:05,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:05,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503271889]
[2025-03-16 14:12:05,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503271889] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:05,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:05,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:05,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694024207]
[2025-03-16 14:12:05,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:05,306 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:05,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:05,307 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:05,307 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:05,307 INFO  L87              Difference]: Start difference. First operand 843 states and 1244 transitions. Second operand  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,910 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:05,910 INFO  L93              Difference]: Finished difference Result 2497 states and 3689 transitions.
[2025-03-16 14:12:05,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:05,911 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 167
[2025-03-16 14:12:05,911 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:05,916 INFO  L225             Difference]: With dead ends: 2497
[2025-03-16 14:12:05,916 INFO  L226             Difference]: Without dead ends: 1655
[2025-03-16 14:12:05,917 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:05,918 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 209 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:05,918 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 141 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:05,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1655 states.
[2025-03-16 14:12:05,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655.
[2025-03-16 14:12:05,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1655 states, 1654 states have (on average 1.3071342200725513) internal successors, (2162), 1654 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2162 transitions.
[2025-03-16 14:12:05,948 INFO  L78                 Accepts]: Start accepts. Automaton has 1655 states and 2162 transitions. Word has length 167
[2025-03-16 14:12:05,948 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:05,948 INFO  L471      AbstractCegarLoop]: Abstraction has 1655 states and 2162 transitions.
[2025-03-16 14:12:05,948 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:05,948 INFO  L276                IsEmpty]: Start isEmpty. Operand 1655 states and 2162 transitions.
[2025-03-16 14:12:05,950 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-16 14:12:05,950 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:05,951 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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]
[2025-03-16 14:12:05,951 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 14:12:05,951 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:05,951 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:05,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -1143084687, now seen corresponding path program 1 times
[2025-03-16 14:12:05,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:05,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279510991]
[2025-03-16 14:12:05,952 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:05,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:05,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-16 14:12:05,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-16 14:12:05,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:05,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:06,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 14:12:06,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:06,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279510991]
[2025-03-16 14:12:06,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279510991] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:06,181 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:06,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:06,181 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579959284]
[2025-03-16 14:12:06,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:06,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:06,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:06,182 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:06,182 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:06,182 INFO  L87              Difference]: Start difference. First operand 1655 states and 2162 transitions. Second operand  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:06,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:06,899 INFO  L93              Difference]: Finished difference Result 4961 states and 6482 transitions.
[2025-03-16 14:12:06,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:06,899 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 172
[2025-03-16 14:12:06,900 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:06,910 INFO  L225             Difference]: With dead ends: 4961
[2025-03-16 14:12:06,910 INFO  L226             Difference]: Without dead ends: 3307
[2025-03-16 14:12:06,913 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:06,914 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 286 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:06,914 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 50 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 14:12:06,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3307 states.
[2025-03-16 14:12:06,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3304.
[2025-03-16 14:12:06,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3304 states, 3303 states have (on average 1.301544050862852) internal successors, (4299), 3303 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:06,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4299 transitions.
[2025-03-16 14:12:06,970 INFO  L78                 Accepts]: Start accepts. Automaton has 3304 states and 4299 transitions. Word has length 172
[2025-03-16 14:12:06,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:06,970 INFO  L471      AbstractCegarLoop]: Abstraction has 3304 states and 4299 transitions.
[2025-03-16 14:12:06,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:06,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 3304 states and 4299 transitions.
[2025-03-16 14:12:06,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-16 14:12:06,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:06,974 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:06,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 14:12:06,975 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:06,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:06,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 716017423, now seen corresponding path program 1 times
[2025-03-16 14:12:06,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:06,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170257726]
[2025-03-16 14:12:06,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:06,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:06,998 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-16 14:12:07,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-16 14:12:07,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:07,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:07,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-03-16 14:12:07,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:07,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170257726]
[2025-03-16 14:12:07,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170257726] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:07,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619045265]
[2025-03-16 14:12:07,182 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:07,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:07,182 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:07,184 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:07,186 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 14:12:07,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-16 14:12:07,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-16 14:12:07,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:07,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:07,300 INFO  L256         TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:07,308 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:07,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-16 14:12:07,347 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:07,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [619045265] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:07,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:07,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-16 14:12:07,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388002751]
[2025-03-16 14:12:07,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:07,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:07,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:07,348 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:07,349 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:07,349 INFO  L87              Difference]: Start difference. First operand 3304 states and 4299 transitions. Second operand  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:07,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:07,578 INFO  L93              Difference]: Finished difference Result 9902 states and 12887 transitions.
[2025-03-16 14:12:07,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:07,579 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 173
[2025-03-16 14:12:07,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:07,599 INFO  L225             Difference]: With dead ends: 9902
[2025-03-16 14:12:07,599 INFO  L226             Difference]: Without dead ends: 6599
[2025-03-16 14:12:07,606 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-16 14:12:07,607 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:07,608 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 534 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 14:12:07,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6599 states.
[2025-03-16 14:12:07,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6591.
[2025-03-16 14:12:07,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6591 states, 6590 states have (on average 1.301062215477997) internal successors, (8574), 6590 states have internal predecessors, (8574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:07,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 8574 transitions.
[2025-03-16 14:12:07,733 INFO  L78                 Accepts]: Start accepts. Automaton has 6591 states and 8574 transitions. Word has length 173
[2025-03-16 14:12:07,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:07,734 INFO  L471      AbstractCegarLoop]: Abstraction has 6591 states and 8574 transitions.
[2025-03-16 14:12:07,734 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:07,734 INFO  L276                IsEmpty]: Start isEmpty. Operand 6591 states and 8574 transitions.
[2025-03-16 14:12:07,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-03-16 14:12:07,740 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:07,740 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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]
[2025-03-16 14:12:07,748 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:07,945 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-16 14:12:07,946 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:07,946 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:07,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -1070164630, now seen corresponding path program 1 times
[2025-03-16 14:12:07,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:07,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586530702]
[2025-03-16 14:12:07,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:07,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:07,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-16 14:12:07,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-16 14:12:07,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:07,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:08,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:08,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:08,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586530702]
[2025-03-16 14:12:08,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586530702] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:08,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108657375]
[2025-03-16 14:12:08,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:08,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:08,137 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:08,139 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:08,140 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 14:12:08,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-16 14:12:08,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-16 14:12:08,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:08,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:08,247 INFO  L256         TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:08,251 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:08,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-16 14:12:08,266 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:08,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108657375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:08,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:08,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-16 14:12:08,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877774594]
[2025-03-16 14:12:08,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:08,267 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:08,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:08,267 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:08,267 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:08,267 INFO  L87              Difference]: Start difference. First operand 6591 states and 8574 transitions. Second operand  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:08,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:08,932 INFO  L93              Difference]: Finished difference Result 16437 states and 21943 transitions.
[2025-03-16 14:12:08,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:08,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 175
[2025-03-16 14:12:08,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:08,960 INFO  L225             Difference]: With dead ends: 16437
[2025-03-16 14:12:08,960 INFO  L226             Difference]: Without dead ends: 9847
[2025-03-16 14:12:08,968 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:08,969 INFO  L435           NwaCegarLoop]: 344 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:08,969 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 365 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:08,978 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9847 states.
[2025-03-16 14:12:09,135 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9847 to 9839.
[2025-03-16 14:12:09,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9839 states, 9838 states have (on average 1.2354137019719456) internal successors, (12154), 9838 states have internal predecessors, (12154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:09,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12154 transitions.
[2025-03-16 14:12:09,166 INFO  L78                 Accepts]: Start accepts. Automaton has 9839 states and 12154 transitions. Word has length 175
[2025-03-16 14:12:09,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:09,166 INFO  L471      AbstractCegarLoop]: Abstraction has 9839 states and 12154 transitions.
[2025-03-16 14:12:09,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:09,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 9839 states and 12154 transitions.
[2025-03-16 14:12:09,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-16 14:12:09,171 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:09,171 INFO  L218           NwaCegarLoop]: trace histogram [4, 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, 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]
[2025-03-16 14:12:09,178 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:09,371 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-16 14:12:09,372 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:09,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:09,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 344359920, now seen corresponding path program 1 times
[2025-03-16 14:12:09,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:09,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237199457]
[2025-03-16 14:12:09,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:09,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:09,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-16 14:12:09,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-16 14:12:09,405 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:09,405 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:09,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-16 14:12:09,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:09,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237199457]
[2025-03-16 14:12:09,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237199457] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:09,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:09,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:09,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034803259]
[2025-03-16 14:12:09,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:09,561 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:12:09,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:09,561 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:12:09,561 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:09,561 INFO  L87              Difference]: Start difference. First operand 9839 states and 12154 transitions. Second operand  has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:10,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:10,291 INFO  L93              Difference]: Finished difference Result 19699 states and 24349 transitions.
[2025-03-16 14:12:10,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:12:10,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 209
[2025-03-16 14:12:10,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:10,333 INFO  L225             Difference]: With dead ends: 19699
[2025-03-16 14:12:10,333 INFO  L226             Difference]: Without dead ends: 9861
[2025-03-16 14:12:10,345 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:10,346 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 461 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:10,346 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 43 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:10,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9861 states.
[2025-03-16 14:12:10,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 9839.
[2025-03-16 14:12:10,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9839 states, 9838 states have (on average 1.2256556210611913) internal successors, (12058), 9838 states have internal predecessors, (12058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:10,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12058 transitions.
[2025-03-16 14:12:10,500 INFO  L78                 Accepts]: Start accepts. Automaton has 9839 states and 12058 transitions. Word has length 209
[2025-03-16 14:12:10,500 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:10,500 INFO  L471      AbstractCegarLoop]: Abstraction has 9839 states and 12058 transitions.
[2025-03-16 14:12:10,500 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:10,501 INFO  L276                IsEmpty]: Start isEmpty. Operand 9839 states and 12058 transitions.
[2025-03-16 14:12:10,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-16 14:12:10,506 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:10,507 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, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:10,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 14:12:10,507 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:10,507 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:10,508 INFO  L85        PathProgramCache]: Analyzing trace with hash 375874706, now seen corresponding path program 1 times
[2025-03-16 14:12:10,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:10,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31653308]
[2025-03-16 14:12:10,508 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:10,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:10,542 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-16 14:12:10,550 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-16 14:12:10,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:10,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:10,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 14:12:10,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:10,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31653308]
[2025-03-16 14:12:10,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31653308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:10,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:10,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:10,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423495658]
[2025-03-16 14:12:10,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:10,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:10,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:10,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:10,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:10,810 INFO  L87              Difference]: Start difference. First operand 9839 states and 12058 transitions. Second operand  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:11,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:11,363 INFO  L93              Difference]: Finished difference Result 22955 states and 27871 transitions.
[2025-03-16 14:12:11,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:11,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223
[2025-03-16 14:12:11,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:11,385 INFO  L225             Difference]: With dead ends: 22955
[2025-03-16 14:12:11,386 INFO  L226             Difference]: Without dead ends: 13117
[2025-03-16 14:12:11,395 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:11,396 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:11,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 113 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:11,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13117 states.
[2025-03-16 14:12:11,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 13109.
[2025-03-16 14:12:11,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13109 states, 13108 states have (on average 1.2018614586512053) internal successors, (15754), 13108 states have internal predecessors, (15754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:11,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 15754 transitions.
[2025-03-16 14:12:11,582 INFO  L78                 Accepts]: Start accepts. Automaton has 13109 states and 15754 transitions. Word has length 223
[2025-03-16 14:12:11,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:11,582 INFO  L471      AbstractCegarLoop]: Abstraction has 13109 states and 15754 transitions.
[2025-03-16 14:12:11,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:11,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 13109 states and 15754 transitions.
[2025-03-16 14:12:11,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-16 14:12:11,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:11,589 INFO  L218           NwaCegarLoop]: trace histogram [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, 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]
[2025-03-16 14:12:11,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 14:12:11,590 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:11,590 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:11,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -410208401, now seen corresponding path program 2 times
[2025-03-16 14:12:11,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:11,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152250603]
[2025-03-16 14:12:11,591 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 14:12:11,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:11,624 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes.
[2025-03-16 14:12:11,645 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-16 14:12:11,646 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 14:12:11,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:11,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 14:12:11,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:11,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152250603]
[2025-03-16 14:12:11,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152250603] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:11,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398324895]
[2025-03-16 14:12:11,979 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 14:12:11,979 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:11,979 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:11,982 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:12:11,984 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 14:12:12,040 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes.
[2025-03-16 14:12:12,096 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-16 14:12:12,096 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 14:12:12,096 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:12,098 INFO  L256         TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:12,101 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:12,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-16 14:12:12,246 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:12,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398324895] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:12,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:12,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-16 14:12:12,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816428181]
[2025-03-16 14:12:12,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:12,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:12,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:12,247 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:12,247 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:12:12,247 INFO  L87              Difference]: Start difference. First operand 13109 states and 15754 transitions. Second operand  has 3 states, 3 states have (on average 74.66666666666667) 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-16 14:12:12,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:12,955 INFO  L93              Difference]: Finished difference Result 36781 states and 44229 transitions.
[2025-03-16 14:12:12,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:12,955 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.66666666666667) 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 230
[2025-03-16 14:12:12,956 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:13,001 INFO  L225             Difference]: With dead ends: 36781
[2025-03-16 14:12:13,001 INFO  L226             Difference]: Without dead ends: 23673
[2025-03-16 14:12:13,016 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 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-16 14:12:13,017 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 152 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:13,017 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 148 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:13,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23673 states.
[2025-03-16 14:12:13,285 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23673 to 23669.
[2025-03-16 14:12:13,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23669 states, 23668 states have (on average 1.1640189285110698) internal successors, (27550), 23668 states have internal predecessors, (27550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:13,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 27550 transitions.
[2025-03-16 14:12:13,337 INFO  L78                 Accepts]: Start accepts. Automaton has 23669 states and 27550 transitions. Word has length 230
[2025-03-16 14:12:13,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:13,337 INFO  L471      AbstractCegarLoop]: Abstraction has 23669 states and 27550 transitions.
[2025-03-16 14:12:13,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.66666666666667) 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-16 14:12:13,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 23669 states and 27550 transitions.
[2025-03-16 14:12:13,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-16 14:12:13,345 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:13,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:13,352 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-16 14:12:13,546 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:13,546 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:13,546 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:13,547 INFO  L85        PathProgramCache]: Analyzing trace with hash -1646254627, now seen corresponding path program 1 times
[2025-03-16 14:12:13,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:13,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433212448]
[2025-03-16 14:12:13,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:13,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:13,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-16 14:12:13,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-16 14:12:13,579 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:13,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:14,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-03-16 14:12:14,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:14,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433212448]
[2025-03-16 14:12:14,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433212448] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:14,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376675216]
[2025-03-16 14:12:14,224 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:14,224 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:14,224 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:14,227 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-16 14:12:14,229 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-16 14:12:14,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-16 14:12:14,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-16 14:12:14,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:14,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:14,340 INFO  L256         TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:14,343 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:14,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-03-16 14:12:14,495 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:14,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [376675216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:14,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:14,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:14,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663427911]
[2025-03-16 14:12:14,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:14,495 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:14,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:14,496 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:14,496 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:14,496 INFO  L87              Difference]: Start difference. First operand 23669 states and 27550 transitions. Second operand  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:15,121 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:15,121 INFO  L93              Difference]: Finished difference Result 60352 states and 70724 transitions.
[2025-03-16 14:12:15,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:15,121 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232
[2025-03-16 14:12:15,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:15,172 INFO  L225             Difference]: With dead ends: 60352
[2025-03-16 14:12:15,172 INFO  L226             Difference]: Without dead ends: 36684
[2025-03-16 14:12:15,197 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 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-16 14:12:15,198 INFO  L435           NwaCegarLoop]: 307 mSDtfsCounter, 105 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:15,198 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 322 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:15,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36684 states.
[2025-03-16 14:12:15,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36684 to 36678.
[2025-03-16 14:12:15,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36678 states, 36677 states have (on average 1.1435231889194863) internal successors, (41941), 36677 states have internal predecessors, (41941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:15,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36678 states to 36678 states and 41941 transitions.
[2025-03-16 14:12:15,614 INFO  L78                 Accepts]: Start accepts. Automaton has 36678 states and 41941 transitions. Word has length 232
[2025-03-16 14:12:15,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:15,614 INFO  L471      AbstractCegarLoop]: Abstraction has 36678 states and 41941 transitions.
[2025-03-16 14:12:15,615 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:15,615 INFO  L276                IsEmpty]: Start isEmpty. Operand 36678 states and 41941 transitions.
[2025-03-16 14:12:15,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-03-16 14:12:15,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:15,627 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 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]
[2025-03-16 14:12:15,634 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-16 14:12:15,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:15,827 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:15,828 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:15,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1396508075, now seen corresponding path program 1 times
[2025-03-16 14:12:15,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:15,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492932105]
[2025-03-16 14:12:15,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:15,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:15,853 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-16 14:12:15,859 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-16 14:12:15,859 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:15,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:16,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 217 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-03-16 14:12:16,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:16,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492932105]
[2025-03-16 14:12:16,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492932105] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:16,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430467845]
[2025-03-16 14:12:16,695 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:16,695 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:16,695 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:16,697 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-16 14:12:16,699 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-16 14:12:16,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-16 14:12:16,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-16 14:12:16,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:16,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:16,823 INFO  L256         TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:16,826 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:16,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 217 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-03-16 14:12:16,860 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:16,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [430467845] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:16,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:16,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:16,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407761328]
[2025-03-16 14:12:16,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:16,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:16,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:16,861 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:16,863 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:16,863 INFO  L87              Difference]: Start difference. First operand 36678 states and 41941 transitions. Second operand  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:17,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:17,559 INFO  L93              Difference]: Finished difference Result 96101 states and 109963 transitions.
[2025-03-16 14:12:17,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:17,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262
[2025-03-16 14:12:17,560 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:17,645 INFO  L225             Difference]: With dead ends: 96101
[2025-03-16 14:12:17,645 INFO  L226             Difference]: Without dead ends: 59424
[2025-03-16 14:12:17,677 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 261 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-16 14:12:17,678 INFO  L435           NwaCegarLoop]: 295 mSDtfsCounter, 221 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:17,679 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 309 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:17,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59424 states.
[2025-03-16 14:12:18,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59424 to 59414.
[2025-03-16 14:12:18,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59414 states, 59413 states have (on average 1.114857017824382) internal successors, (66237), 59413 states have internal predecessors, (66237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:18,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59414 states to 59414 states and 66237 transitions.
[2025-03-16 14:12:18,352 INFO  L78                 Accepts]: Start accepts. Automaton has 59414 states and 66237 transitions. Word has length 262
[2025-03-16 14:12:18,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:18,352 INFO  L471      AbstractCegarLoop]: Abstraction has 59414 states and 66237 transitions.
[2025-03-16 14:12:18,352 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:18,352 INFO  L276                IsEmpty]: Start isEmpty. Operand 59414 states and 66237 transitions.
[2025-03-16 14:12:18,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 310
[2025-03-16 14:12:18,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:18,374 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:18,383 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-16 14:12:18,575 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,SelfDestructingSolverStorable12
[2025-03-16 14:12:18,575 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:18,576 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:18,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -736414948, now seen corresponding path program 1 times
[2025-03-16 14:12:18,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:18,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473617024]
[2025-03-16 14:12:18,576 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:18,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:18,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes.
[2025-03-16 14:12:18,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements.
[2025-03-16 14:12:18,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:18,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:18,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 191 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-16 14:12:18,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:18,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473617024]
[2025-03-16 14:12:18,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473617024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:18,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:18,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:18,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066961808]
[2025-03-16 14:12:18,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:18,705 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:18,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:18,705 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:18,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:18,706 INFO  L87              Difference]: Start difference. First operand 59414 states and 66237 transitions. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:19,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:19,502 INFO  L93              Difference]: Finished difference Result 114155 states and 127016 transitions.
[2025-03-16 14:12:19,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:19,503 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 309
[2025-03-16 14:12:19,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:19,565 INFO  L225             Difference]: With dead ends: 114155
[2025-03-16 14:12:19,565 INFO  L226             Difference]: Without dead ends: 54742
[2025-03-16 14:12:19,587 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:19,587 INFO  L435           NwaCegarLoop]: 316 mSDtfsCounter, 225 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:19,587 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 335 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:19,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54742 states.
[2025-03-16 14:12:20,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54742 to 54728.
[2025-03-16 14:12:20,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54728 states, 54727 states have (on average 1.096003800683392) internal successors, (59981), 54727 states have internal predecessors, (59981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:20,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54728 states to 54728 states and 59981 transitions.
[2025-03-16 14:12:20,345 INFO  L78                 Accepts]: Start accepts. Automaton has 54728 states and 59981 transitions. Word has length 309
[2025-03-16 14:12:20,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:20,345 INFO  L471      AbstractCegarLoop]: Abstraction has 54728 states and 59981 transitions.
[2025-03-16 14:12:20,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:20,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 54728 states and 59981 transitions.
[2025-03-16 14:12:20,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-16 14:12:20,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:20,374 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:20,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 14:12:20,374 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:20,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:20,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917052638, now seen corresponding path program 1 times
[2025-03-16 14:12:20,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:20,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141102389]
[2025-03-16 14:12:20,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:20,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:20,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-16 14:12:20,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-16 14:12:20,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:20,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:20,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 242 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-03-16 14:12:20,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:20,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141102389]
[2025-03-16 14:12:20,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141102389] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:20,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:20,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:20,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816914603]
[2025-03-16 14:12:20,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:20,729 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:20,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:20,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:20,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:20,730 INFO  L87              Difference]: Start difference. First operand 54728 states and 59981 transitions. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:21,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:21,463 INFO  L93              Difference]: Finished difference Result 118815 states and 130285 transitions.
[2025-03-16 14:12:21,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:21,464 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 334
[2025-03-16 14:12:21,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:21,536 INFO  L225             Difference]: With dead ends: 118815
[2025-03-16 14:12:21,536 INFO  L226             Difference]: Without dead ends: 64088
[2025-03-16 14:12:21,575 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:21,576 INFO  L435           NwaCegarLoop]: 321 mSDtfsCounter, 85 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:21,576 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 334 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 14:12:21,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64088 states.
[2025-03-16 14:12:22,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64088 to 53713.
[2025-03-16 14:12:22,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53713 states, 53712 states have (on average 1.0976690497467978) internal successors, (58958), 53712 states have internal predecessors, (58958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:22,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53713 states to 53713 states and 58958 transitions.
[2025-03-16 14:12:22,324 INFO  L78                 Accepts]: Start accepts. Automaton has 53713 states and 58958 transitions. Word has length 334
[2025-03-16 14:12:22,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:22,324 INFO  L471      AbstractCegarLoop]: Abstraction has 53713 states and 58958 transitions.
[2025-03-16 14:12:22,325 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:22,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 53713 states and 58958 transitions.
[2025-03-16 14:12:22,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-03-16 14:12:22,340 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:22,340 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 14:12:22,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 14:12:22,340 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:22,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:22,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 561326290, now seen corresponding path program 1 times
[2025-03-16 14:12:22,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:22,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26036045]
[2025-03-16 14:12:22,341 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:22,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:22,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-03-16 14:12:22,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-03-16 14:12:22,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:22,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:22,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 283 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-03-16 14:12:22,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:22,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26036045]
[2025-03-16 14:12:22,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26036045] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:22,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:22,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:12:22,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384734953]
[2025-03-16 14:12:22,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:22,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:12:22,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:22,713 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:12:22,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:22,714 INFO  L87              Difference]: Start difference. First operand 53713 states and 58958 transitions. Second operand  has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:23,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:23,582 INFO  L93              Difference]: Finished difference Result 107663 states and 118185 transitions.
[2025-03-16 14:12:23,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:12:23,583 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 350
[2025-03-16 14:12:23,583 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:23,743 INFO  L225             Difference]: With dead ends: 107663
[2025-03-16 14:12:23,743 INFO  L226             Difference]: Without dead ends: 54154
[2025-03-16 14:12:23,761 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:12:23,762 INFO  L435           NwaCegarLoop]: 68 mSDtfsCounter, 299 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:23,762 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 86 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:23,782 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54154 states.
[2025-03-16 14:12:24,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54154 to 53713.
[2025-03-16 14:12:24,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53713 states, 53712 states have (on average 1.0976690497467978) internal successors, (58958), 53712 states have internal predecessors, (58958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:24,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53713 states to 53713 states and 58958 transitions.
[2025-03-16 14:12:24,484 INFO  L78                 Accepts]: Start accepts. Automaton has 53713 states and 58958 transitions. Word has length 350
[2025-03-16 14:12:24,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:24,484 INFO  L471      AbstractCegarLoop]: Abstraction has 53713 states and 58958 transitions.
[2025-03-16 14:12:24,484 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:24,484 INFO  L276                IsEmpty]: Start isEmpty. Operand 53713 states and 58958 transitions.
[2025-03-16 14:12:24,503 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 358
[2025-03-16 14:12:24,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:24,504 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:24,504 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 14:12:24,504 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:24,504 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:24,504 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291867733, now seen corresponding path program 1 times
[2025-03-16 14:12:24,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:24,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358962024]
[2025-03-16 14:12:24,505 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:24,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:24,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes.
[2025-03-16 14:12:24,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements.
[2025-03-16 14:12:24,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:24,565 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:25,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked.
[2025-03-16 14:12:25,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:25,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358962024]
[2025-03-16 14:12:25,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358962024] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:25,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432949156]
[2025-03-16 14:12:25,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:25,480 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:25,480 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:25,483 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-16 14:12:25,483 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-16 14:12:25,552 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes.
[2025-03-16 14:12:25,621 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements.
[2025-03-16 14:12:25,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:25,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:25,624 INFO  L256         TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:25,627 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:25,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2025-03-16 14:12:25,757 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:25,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [432949156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:25,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:25,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-03-16 14:12:25,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037689524]
[2025-03-16 14:12:25,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:25,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:25,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:25,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:25,758 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:25,758 INFO  L87              Difference]: Start difference. First operand 53713 states and 58958 transitions. Second operand  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:26,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:26,310 INFO  L93              Difference]: Finished difference Result 139530 states and 153190 transitions.
[2025-03-16 14:12:26,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:26,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 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 357
[2025-03-16 14:12:26,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:26,420 INFO  L225             Difference]: With dead ends: 139530
[2025-03-16 14:12:26,420 INFO  L226             Difference]: Without dead ends: 86021
[2025-03-16 14:12:26,466 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:26,466 INFO  L435           NwaCegarLoop]: 235 mSDtfsCounter, 192 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:26,466 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 437 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 14:12:26,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86021 states.
[2025-03-16 14:12:27,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86021 to 86019.
[2025-03-16 14:12:27,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86019 states, 86018 states have (on average 1.097758608663303) internal successors, (94427), 86018 states have internal predecessors, (94427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:27,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86019 states to 86019 states and 94427 transitions.
[2025-03-16 14:12:27,793 INFO  L78                 Accepts]: Start accepts. Automaton has 86019 states and 94427 transitions. Word has length 357
[2025-03-16 14:12:27,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:27,793 INFO  L471      AbstractCegarLoop]: Abstraction has 86019 states and 94427 transitions.
[2025-03-16 14:12:27,793 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:27,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 86019 states and 94427 transitions.
[2025-03-16 14:12:27,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 393
[2025-03-16 14:12:27,815 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:27,815 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:27,822 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-16 14:12:28,016 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-16 14:12:28,017 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:28,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:28,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 1398505279, now seen corresponding path program 1 times
[2025-03-16 14:12:28,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:28,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139286503]
[2025-03-16 14:12:28,017 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:28,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:28,053 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-03-16 14:12:28,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-03-16 14:12:28,062 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:28,062 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:28,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 556 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked.
[2025-03-16 14:12:28,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:28,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139286503]
[2025-03-16 14:12:28,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139286503] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:28,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:12:28,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:12:28,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028467148]
[2025-03-16 14:12:28,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:28,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:28,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:28,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:28,225 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:28,225 INFO  L87              Difference]: Start difference. First operand 86019 states and 94427 transitions. Second operand  has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:29,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:29,259 INFO  L93              Difference]: Finished difference Result 209276 states and 229441 transitions.
[2025-03-16 14:12:29,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:29,260 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 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 392
[2025-03-16 14:12:29,260 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:29,415 INFO  L225             Difference]: With dead ends: 209276
[2025-03-16 14:12:29,415 INFO  L226             Difference]: Without dead ends: 123461
[2025-03-16 14:12:29,484 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:12:29,485 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:29,485 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 151 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 14:12:29,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123461 states.
[2025-03-16 14:12:30,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123461 to 108020.
[2025-03-16 14:12:30,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108020 states, 108019 states have (on average 1.1040465103361445) internal successors, (119258), 108019 states have internal predecessors, (119258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:31,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108020 states to 108020 states and 119258 transitions.
[2025-03-16 14:12:31,046 INFO  L78                 Accepts]: Start accepts. Automaton has 108020 states and 119258 transitions. Word has length 392
[2025-03-16 14:12:31,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:31,046 INFO  L471      AbstractCegarLoop]: Abstraction has 108020 states and 119258 transitions.
[2025-03-16 14:12:31,046 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:31,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 108020 states and 119258 transitions.
[2025-03-16 14:12:31,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 394
[2025-03-16 14:12:31,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:31,071 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:31,071 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 14:12:31,071 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:31,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:31,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -728057716, now seen corresponding path program 1 times
[2025-03-16 14:12:31,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:31,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844718477]
[2025-03-16 14:12:31,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:31,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:31,109 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-03-16 14:12:31,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-03-16 14:12:31,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:31,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:32,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 574 backedges. 261 proven. 6 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked.
[2025-03-16 14:12:32,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:32,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844718477]
[2025-03-16 14:12:32,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844718477] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:32,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377409004]
[2025-03-16 14:12:32,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:32,534 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:32,534 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:32,536 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-16 14:12:32,536 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-16 14:12:32,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes.
[2025-03-16 14:12:32,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements.
[2025-03-16 14:12:32,727 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:32,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:32,730 INFO  L256         TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:32,735 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:32,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 574 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked.
[2025-03-16 14:12:32,876 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:32,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [377409004] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:32,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:32,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-03-16 14:12:32,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999938181]
[2025-03-16 14:12:32,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:32,877 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:32,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:32,878 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:32,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:32,878 INFO  L87              Difference]: Start difference. First operand 108020 states and 119258 transitions. Second operand  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:33,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:33,781 INFO  L93              Difference]: Finished difference Result 311243 states and 343897 transitions.
[2025-03-16 14:12:33,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:33,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 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 393
[2025-03-16 14:12:33,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:34,032 INFO  L225             Difference]: With dead ends: 311243
[2025-03-16 14:12:34,032 INFO  L226             Difference]: Without dead ends: 203427
[2025-03-16 14:12:34,129 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 392 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-16 14:12:34,130 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 246 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:34,130 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 528 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 14:12:34,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203427 states.
[2025-03-16 14:12:36,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203427 to 203425.
[2025-03-16 14:12:36,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203425 states, 203424 states have (on average 1.1049876120811704) internal successors, (224781), 203424 states have internal predecessors, (224781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:36,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203425 states to 203425 states and 224781 transitions.
[2025-03-16 14:12:36,844 INFO  L78                 Accepts]: Start accepts. Automaton has 203425 states and 224781 transitions. Word has length 393
[2025-03-16 14:12:36,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:36,844 INFO  L471      AbstractCegarLoop]: Abstraction has 203425 states and 224781 transitions.
[2025-03-16 14:12:36,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:36,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 203425 states and 224781 transitions.
[2025-03-16 14:12:36,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 411
[2025-03-16 14:12:36,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:36,874 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:12:36,881 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-16 14:12:37,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:37,075 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:37,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:37,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 645889847, now seen corresponding path program 1 times
[2025-03-16 14:12:37,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:37,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833648151]
[2025-03-16 14:12:37,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:37,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:37,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-03-16 14:12:37,146 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-03-16 14:12:37,146 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:37,146 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:37,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 410 backedges. 286 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:12:37,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:37,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833648151]
[2025-03-16 14:12:37,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833648151] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:37,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105343504]
[2025-03-16 14:12:37,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:37,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:37,940 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:37,942 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-16 14:12:37,943 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-16 14:12:38,037 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-03-16 14:12:38,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-03-16 14:12:38,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:38,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:38,134 INFO  L256         TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:38,140 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:38,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 410 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked.
[2025-03-16 14:12:38,386 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:38,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105343504] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:38,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:38,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-16 14:12:38,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986842217]
[2025-03-16 14:12:38,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:38,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:12:38,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:38,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:12:38,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:38,387 INFO  L87              Difference]: Start difference. First operand 203425 states and 224781 transitions. Second operand  has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:39,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:12:39,814 INFO  L93              Difference]: Finished difference Result 402208 states and 444631 transitions.
[2025-03-16 14:12:39,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:12:39,815 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 410
[2025-03-16 14:12:39,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:12:40,346 INFO  L225             Difference]: With dead ends: 402208
[2025-03-16 14:12:40,347 INFO  L226             Difference]: Without dead ends: 198987
[2025-03-16 14:12:40,421 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:40,421 INFO  L435           NwaCegarLoop]: 280 mSDtfsCounter, 109 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:12:40,421 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 288 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:12:40,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198987 states.
[2025-03-16 14:12:42,446 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198987 to 198959.
[2025-03-16 14:12:42,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198959 states, 198958 states have (on average 1.101926034640477) internal successors, (219237), 198958 states have internal predecessors, (219237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:42,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198959 states to 198959 states and 219237 transitions.
[2025-03-16 14:12:42,888 INFO  L78                 Accepts]: Start accepts. Automaton has 198959 states and 219237 transitions. Word has length 410
[2025-03-16 14:12:42,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:12:42,889 INFO  L471      AbstractCegarLoop]: Abstraction has 198959 states and 219237 transitions.
[2025-03-16 14:12:42,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:12:42,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 198959 states and 219237 transitions.
[2025-03-16 14:12:42,981 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 521
[2025-03-16 14:12:42,981 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:12:42,982 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-16 14:12:42,989 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-16 14:12:43,182 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:43,182 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:12:43,183 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:12:43,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -428021898, now seen corresponding path program 1 times
[2025-03-16 14:12:43,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:12:43,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051845149]
[2025-03-16 14:12:43,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:43,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:12:43,261 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes.
[2025-03-16 14:12:43,303 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements.
[2025-03-16 14:12:43,303 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:43,303 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:43,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 755 backedges. 521 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2025-03-16 14:12:43,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:12:43,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051845149]
[2025-03-16 14:12:43,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051845149] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:12:43,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434346848]
[2025-03-16 14:12:43,970 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:12:43,970 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:12:43,970 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:12:43,973 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-16 14:12:43,974 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-16 14:12:44,056 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes.
[2025-03-16 14:12:44,151 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements.
[2025-03-16 14:12:44,151 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:12:44,151 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:12:44,154 INFO  L256         TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-16 14:12:44,160 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:12:44,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 755 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2025-03-16 14:12:44,352 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:12:44,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434346848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:12:44,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:12:44,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-16 14:12:44,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221836990]
[2025-03-16 14:12:44,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:12:44,352 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:12:44,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:12:44,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:12:44,353 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-16 14:12:44,353 INFO  L87              Difference]: Start difference. First operand 198959 states and 219237 transitions. Second operand  has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)