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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label26.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 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:49:09,210 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:49:09,260 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:49:09,267 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:49:09,267 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:49:09,288 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:49:09,289 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:49:09,289 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:49:09,289 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:49:09,289 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:49:09,289 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:49:09,289 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:49:09,289 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:49:09,289 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:49:09,290 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:49:09,290 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:49:09,291 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:09,292 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:49:09,292 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:49:09,292 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 -> 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717
[2025-03-03 09:49:09,525 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:49:09,532 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:49:09,534 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:49:09,535 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:49:09,535 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:49:09,537 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label26.c
[2025-03-03 09:49:10,674 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d342f32/fff5199c1b1c4e5e83b43bf59c82fa81/FLAGc71038b31
[2025-03-03 09:49:11,027 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:49:11,027 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c
[2025-03-03 09:49:11,039 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d342f32/fff5199c1b1c4e5e83b43bf59c82fa81/FLAGc71038b31
[2025-03-03 09:49:11,054 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d342f32/fff5199c1b1c4e5e83b43bf59c82fa81
[2025-03-03 09:49:11,058 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:49:11,060 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:49:11,061 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:11,062 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:49:11,065 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:49:11,066 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,067 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dd8524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11, skipping insertion in model container
[2025-03-03 09:49:11,068 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,098 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:49:11,344 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/Problem02_label26.c[20881,20894]
[2025-03-03 09:49:11,365 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:11,376 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:49:11,452 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/Problem02_label26.c[20881,20894]
[2025-03-03 09:49:11,459 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:11,476 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:49:11,477 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11 WrapperNode
[2025-03-03 09:49:11,477 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:11,478 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:11,479 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:49:11,479 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:49:11,483 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,498 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,543 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666
[2025-03-03 09:49:11,543 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:11,544 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:49:11,544 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:49:11,544 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:49:11,552 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,552 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,555 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,578 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 09:49:11,578 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,578 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,596 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,599 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,600 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,606 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,611 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:49:11,612 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:49:11,613 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:49:11,613 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:49:11,614 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (1/1) ...
[2025-03-03 09:49:11,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:11,627 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:11,639 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:49:11,642 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:49:11,662 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:49:11,662 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:49:11,662 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:49:11,662 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:49:11,711 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:49:11,712 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:49:12,401 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-03 09:49:12,402 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:49:12,416 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:49:12,416 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:49:12,416 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:12 BoogieIcfgContainer
[2025-03-03 09:49:12,416 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:49:12,418 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:49:12,418 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:49:12,421 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:49:12,422 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:11" (1/3) ...
[2025-03-03 09:49:12,422 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd4f583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:12, skipping insertion in model container
[2025-03-03 09:49:12,422 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:11" (2/3) ...
[2025-03-03 09:49:12,423 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd4f583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:12, skipping insertion in model container
[2025-03-03 09:49:12,423 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:12" (3/3) ...
[2025-03-03 09:49:12,424 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem02_label26.c
[2025-03-03 09:49:12,434 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:49:12,436 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label26.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:49:12,482 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:49:12,490 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;@4e4d17a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:49:12,491 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:49:12,495 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:12,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-03-03 09:49:12,505 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:12,505 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]
[2025-03-03 09:49:12,506 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:12,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:12,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 905483448, now seen corresponding path program 1 times
[2025-03-03 09:49:12,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:12,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338516160]
[2025-03-03 09:49:12,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:12,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:12,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-03 09:49:12,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-03 09:49:12,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:12,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:13,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:13,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:13,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338516160]
[2025-03-03 09:49:13,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338516160] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:13,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:13,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:13,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884217173]
[2025-03-03 09:49:13,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:13,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:13,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:13,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:13,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:13,033 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,602 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:13,603 INFO  L93              Difference]: Finished difference Result 596 states and 1027 transitions.
[2025-03-03 09:49:13,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:13,605 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136
[2025-03-03 09:49:13,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:13,613 INFO  L225             Difference]: With dead ends: 596
[2025-03-03 09:49:13,613 INFO  L226             Difference]: Without dead ends: 305
[2025-03-03 09:49:13,616 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:13,619 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:13,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:49:13,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2025-03-03 09:49:13,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2025-03-03 09:49:13,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions.
[2025-03-03 09:49:13,664 INFO  L78                 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 136
[2025-03-03 09:49:13,664 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:13,664 INFO  L471      AbstractCegarLoop]: Abstraction has 305 states and 464 transitions.
[2025-03-03 09:49:13,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:13,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions.
[2025-03-03 09:49:13,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-03 09:49:13,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:13,668 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:49:13,668 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:49:13,668 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:13,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:13,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -2123441338, now seen corresponding path program 1 times
[2025-03-03 09:49:13,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:13,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23319462]
[2025-03-03 09:49:13,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:13,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:13,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-03 09:49:13,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-03 09:49:13,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:13,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:13,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:13,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:13,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23319462]
[2025-03-03 09:49:13,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23319462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:13,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:13,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:13,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552645635]
[2025-03-03 09:49:13,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:13,848 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:13,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:13,848 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:13,848 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:13,849 INFO  L87              Difference]: Start difference. First operand 305 states and 464 transitions. Second operand  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,229 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:14,229 INFO  L93              Difference]: Finished difference Result 902 states and 1375 transitions.
[2025-03-03 09:49:14,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:14,229 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147
[2025-03-03 09:49:14,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:14,232 INFO  L225             Difference]: With dead ends: 902
[2025-03-03 09:49:14,232 INFO  L226             Difference]: Without dead ends: 599
[2025-03-03 09:49:14,233 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:14,233 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:14,233 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:49:14,234 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 599 states.
[2025-03-03 09:49:14,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596.
[2025-03-03 09:49:14,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 596 states, 595 states have (on average 1.477310924369748) internal successors, (879), 595 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions.
[2025-03-03 09:49:14,259 INFO  L78                 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 147
[2025-03-03 09:49:14,259 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:14,259 INFO  L471      AbstractCegarLoop]: Abstraction has 596 states and 879 transitions.
[2025-03-03 09:49:14,260 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,260 INFO  L276                IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions.
[2025-03-03 09:49:14,262 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-03 09:49:14,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:14,262 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-03-03 09:49:14,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:49:14,263 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:14,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:14,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -170517885, now seen corresponding path program 1 times
[2025-03-03 09:49:14,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:14,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783728871]
[2025-03-03 09:49:14,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:14,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:14,291 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-03 09:49:14,302 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-03 09:49:14,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:14,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:14,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:49:14,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:14,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783728871]
[2025-03-03 09:49:14,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783728871] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:14,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:14,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:14,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791224623]
[2025-03-03 09:49:14,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:14,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:14,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:14,400 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:14,400 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:14,400 INFO  L87              Difference]: Start difference. First operand 596 states and 879 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:14,587 INFO  L93              Difference]: Finished difference Result 1040 states and 1541 transitions.
[2025-03-03 09:49:14,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:14,588 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 151
[2025-03-03 09:49:14,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:14,589 INFO  L225             Difference]: With dead ends: 1040
[2025-03-03 09:49:14,589 INFO  L226             Difference]: Without dead ends: 446
[2025-03-03 09:49:14,590 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:14,591 INFO  L435           NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:14,591 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:14,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 446 states.
[2025-03-03 09:49:14,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446.
[2025-03-03 09:49:14,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 446 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions.
[2025-03-03 09:49:14,603 INFO  L78                 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 151
[2025-03-03 09:49:14,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:14,603 INFO  L471      AbstractCegarLoop]: Abstraction has 446 states and 634 transitions.
[2025-03-03 09:49:14,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:14,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions.
[2025-03-03 09:49:14,604 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-03 09:49:14,604 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:14,604 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:14,604 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:49:14,604 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:14,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:14,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 1408800243, now seen corresponding path program 1 times
[2025-03-03 09:49:14,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:14,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25597530]
[2025-03-03 09:49:14,605 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:14,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:14,620 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-03 09:49:14,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-03 09:49:14,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:14,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:14,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:14,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:14,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25597530]
[2025-03-03 09:49:14,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25597530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:14,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:14,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:14,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637489590]
[2025-03-03 09:49:14,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:14,747 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:14,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:14,748 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:14,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:14,748 INFO  L87              Difference]: Start difference. First operand 446 states and 634 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,090 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:15,091 INFO  L93              Difference]: Finished difference Result 1326 states and 1888 transitions.
[2025-03-03 09:49:15,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:15,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-03 09:49:15,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:15,095 INFO  L225             Difference]: With dead ends: 1326
[2025-03-03 09:49:15,095 INFO  L226             Difference]: Without dead ends: 882
[2025-03-03 09:49:15,095 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:15,097 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:15,098 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 84 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:15,099 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 882 states.
[2025-03-03 09:49:15,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875.
[2025-03-03 09:49:15,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 875 states, 874 states have (on average 1.3729977116704806) internal successors, (1200), 874 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions.
[2025-03-03 09:49:15,118 INFO  L78                 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 154
[2025-03-03 09:49:15,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:15,118 INFO  L471      AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions.
[2025-03-03 09:49:15,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions.
[2025-03-03 09:49:15,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-03-03 09:49:15,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:15,120 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:15,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:49:15,121 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:15,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:15,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1697034729, now seen corresponding path program 1 times
[2025-03-03 09:49:15,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:15,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018504036]
[2025-03-03 09:49:15,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:15,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:15,142 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-03-03 09:49:15,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-03-03 09:49:15,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:15,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:15,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:15,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:15,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018504036]
[2025-03-03 09:49:15,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018504036] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:15,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:15,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:15,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022958597]
[2025-03-03 09:49:15,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:15,204 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:15,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:15,205 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:15,205 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:15,205 INFO  L87              Difference]: Start difference. First operand 875 states and 1200 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:15,540 INFO  L93              Difference]: Finished difference Result 2591 states and 3558 transitions.
[2025-03-03 09:49:15,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:15,540 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158
[2025-03-03 09:49:15,540 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:15,545 INFO  L225             Difference]: With dead ends: 2591
[2025-03-03 09:49:15,545 INFO  L226             Difference]: Without dead ends: 1718
[2025-03-03 09:49:15,546 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:15,547 INFO  L435           NwaCegarLoop]: 51 mSDtfsCounter, 158 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:15,547 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 62 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:15,548 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2025-03-03 09:49:15,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718.
[2025-03-03 09:49:15,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1718 states, 1717 states have (on average 1.2958648806057076) internal successors, (2225), 1717 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2225 transitions.
[2025-03-03 09:49:15,583 INFO  L78                 Accepts]: Start accepts. Automaton has 1718 states and 2225 transitions. Word has length 158
[2025-03-03 09:49:15,583 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:15,583 INFO  L471      AbstractCegarLoop]: Abstraction has 1718 states and 2225 transitions.
[2025-03-03 09:49:15,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:15,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 1718 states and 2225 transitions.
[2025-03-03 09:49:15,586 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-03-03 09:49:15,587 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:15,587 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:15,587 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:49:15,587 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:15,587 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:15,588 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738266602, now seen corresponding path program 1 times
[2025-03-03 09:49:15,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:15,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388212790]
[2025-03-03 09:49:15,588 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:15,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:15,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-03-03 09:49:15,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-03-03 09:49:15,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:15,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:15,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:15,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:15,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388212790]
[2025-03-03 09:49:15,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388212790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:15,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:15,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:15,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526695287]
[2025-03-03 09:49:15,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:15,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:15,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:15,704 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:15,704 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:15,705 INFO  L87              Difference]: Start difference. First operand 1718 states and 2225 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:16,050 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:16,051 INFO  L93              Difference]: Finished difference Result 4273 states and 5527 transitions.
[2025-03-03 09:49:16,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:16,051 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158
[2025-03-03 09:49:16,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:16,059 INFO  L225             Difference]: With dead ends: 4273
[2025-03-03 09:49:16,059 INFO  L226             Difference]: Without dead ends: 2557
[2025-03-03 09:49:16,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:16,062 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:16,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 74 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:16,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2557 states.
[2025-03-03 09:49:16,095 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2277.
[2025-03-03 09:49:16,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2277 states, 2276 states have (on average 1.2280316344463973) internal successors, (2795), 2276 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:16,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2795 transitions.
[2025-03-03 09:49:16,135 INFO  L78                 Accepts]: Start accepts. Automaton has 2277 states and 2795 transitions. Word has length 158
[2025-03-03 09:49:16,135 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:16,136 INFO  L471      AbstractCegarLoop]: Abstraction has 2277 states and 2795 transitions.
[2025-03-03 09:49:16,136 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:16,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 2277 states and 2795 transitions.
[2025-03-03 09:49:16,139 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-03-03 09:49:16,139 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:16,139 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1]
[2025-03-03 09:49:16,139 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:49:16,139 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:16,140 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:16,140 INFO  L85        PathProgramCache]: Analyzing trace with hash 1257059558, now seen corresponding path program 1 times
[2025-03-03 09:49:16,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:16,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492379097]
[2025-03-03 09:49:16,140 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:16,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:16,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-03 09:49:16,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-03 09:49:16,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:16,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:16,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:16,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:16,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492379097]
[2025-03-03 09:49:16,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492379097] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:49:16,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929767544]
[2025-03-03 09:49:16,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:16,414 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:16,414 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:16,416 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:49:16,418 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:49:16,456 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-03 09:49:16,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-03 09:49:16,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:16,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:16,491 INFO  L256         TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:49:16,495 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:49:16,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:49:16,654 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:49:16,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929767544] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:16,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:49:16,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:49:16,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257600031]
[2025-03-03 09:49:16,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:16,655 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:16,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:16,656 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:16,656 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:16,656 INFO  L87              Difference]: Start difference. First operand 2277 states and 2795 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:16,994 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:16,994 INFO  L93              Difference]: Finished difference Result 4550 states and 5586 transitions.
[2025-03-03 09:49:16,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:16,995 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 163
[2025-03-03 09:49:16,996 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:17,002 INFO  L225             Difference]: With dead ends: 4550
[2025-03-03 09:49:17,003 INFO  L226             Difference]: Without dead ends: 2275
[2025-03-03 09:49:17,005 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 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-03 09:49:17,006 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:17,006 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 212 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:17,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2275 states.
[2025-03-03 09:49:17,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2275.
[2025-03-03 09:49:17,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2275 states, 2274 states have (on average 1.154353562005277) internal successors, (2625), 2274 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:17,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2625 transitions.
[2025-03-03 09:49:17,038 INFO  L78                 Accepts]: Start accepts. Automaton has 2275 states and 2625 transitions. Word has length 163
[2025-03-03 09:49:17,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:17,039 INFO  L471      AbstractCegarLoop]: Abstraction has 2275 states and 2625 transitions.
[2025-03-03 09:49:17,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:17,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 2275 states and 2625 transitions.
[2025-03-03 09:49:17,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-03-03 09:49:17,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:17,042 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:17,048 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:49:17,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:17,244 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:17,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:17,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094527825, now seen corresponding path program 1 times
[2025-03-03 09:49:17,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:17,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202789033]
[2025-03-03 09:49:17,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:17,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:17,264 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-03 09:49:17,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-03 09:49:17,275 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:17,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:17,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:49:17,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:17,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202789033]
[2025-03-03 09:49:17,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202789033] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:17,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:17,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:17,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560887301]
[2025-03-03 09:49:17,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:17,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:17,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:17,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:17,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:17,381 INFO  L87              Difference]: Start difference. First operand 2275 states and 2625 transitions. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:17,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:17,694 INFO  L93              Difference]: Finished difference Result 3835 states and 4419 transitions.
[2025-03-03 09:49:17,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:17,694 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229
[2025-03-03 09:49:17,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:17,702 INFO  L225             Difference]: With dead ends: 3835
[2025-03-03 09:49:17,702 INFO  L226             Difference]: Without dead ends: 2134
[2025-03-03 09:49:17,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:17,704 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:17,704 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 240 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:17,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2134 states.
[2025-03-03 09:49:17,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2134.
[2025-03-03 09:49:17,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2134 states, 2133 states have (on average 1.1275199249882795) internal successors, (2405), 2133 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:17,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2405 transitions.
[2025-03-03 09:49:17,734 INFO  L78                 Accepts]: Start accepts. Automaton has 2134 states and 2405 transitions. Word has length 229
[2025-03-03 09:49:17,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:17,734 INFO  L471      AbstractCegarLoop]: Abstraction has 2134 states and 2405 transitions.
[2025-03-03 09:49:17,734 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:17,735 INFO  L276                IsEmpty]: Start isEmpty. Operand 2134 states and 2405 transitions.
[2025-03-03 09:49:17,738 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2025-03-03 09:49:17,738 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:17,738 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:49:17,738 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:49:17,739 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:17,739 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:17,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -8926754, now seen corresponding path program 1 times
[2025-03-03 09:49:17,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:17,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475835987]
[2025-03-03 09:49:17,740 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:17,740 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:17,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes.
[2025-03-03 09:49:17,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements.
[2025-03-03 09:49:17,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:17,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:17,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-03-03 09:49:17,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:17,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475835987]
[2025-03-03 09:49:17,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475835987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:17,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:17,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:17,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761999884]
[2025-03-03 09:49:17,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:17,819 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:17,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:17,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:17,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:17,819 INFO  L87              Difference]: Start difference. First operand 2134 states and 2405 transitions. Second operand  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:18,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:18,130 INFO  L93              Difference]: Finished difference Result 2977 states and 3338 transitions.
[2025-03-03 09:49:18,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:18,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 238
[2025-03-03 09:49:18,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:18,131 INFO  L225             Difference]: With dead ends: 2977
[2025-03-03 09:49:18,131 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:49:18,133 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:18,134 INFO  L435           NwaCegarLoop]: 211 mSDtfsCounter, 111 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:18,135 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 224 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:18,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:49:18,135 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:49:18,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:18,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:49:18,135 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238
[2025-03-03 09:49:18,135 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:18,135 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:49:18,135 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:18,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:49:18,137 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:49:18,139 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:49:18,139 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:49:18,141 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:18,142 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:49:18,264 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:49:18,280 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:18 BoogieIcfgContainer
[2025-03-03 09:49:18,280 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:49:18,280 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:49:18,280 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:49:18,280 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:49:18,283 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:12" (3/4) ...
[2025-03-03 09:49:18,284 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:49:18,297 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-03 09:49:18,300 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:49:18,301 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:49:18,301 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:49:18,403 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:49:18,403 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:49:18,403 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:49:18,404 INFO  L158              Benchmark]: Toolchain (without parser) took 7344.47ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 122.2MB in the beginning and 276.9MB in the end (delta: -154.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,404 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:18,405 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 96.2MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,405 INFO  L158              Benchmark]: Boogie Procedure Inliner took 65.30ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 91.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,405 INFO  L158              Benchmark]: Boogie Preprocessor took 67.41ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 87.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:18,405 INFO  L158              Benchmark]: IcfgBuilder took 803.73ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 92.4MB in the end (delta: -4.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,406 INFO  L158              Benchmark]: TraceAbstraction took 5862.08ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 91.6MB in the beginning and 289.3MB in the end (delta: -197.8MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,406 INFO  L158              Benchmark]: Witness Printer took 123.08ms. Allocated memory is still 369.1MB. Free memory was 289.3MB in the beginning and 276.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:18,407 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 416.86ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 96.2MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 65.30ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 91.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 67.41ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 87.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 803.73ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 92.4MB in the end (delta: -4.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5862.08ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 91.6MB in the beginning and 289.3MB in the end (delta: -197.8MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB.
 * Witness Printer took 123.08ms. Allocated memory is still 369.1MB. Free memory was 289.3MB in the beginning and 276.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 590]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 1079 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3042 IncrementalHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 960 mSDtfsCounter, 3042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2277occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 290 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1697 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1687 ConstructedInterpolants, 0 QuantifiedInterpolants, 4373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 402/418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Location Invariant
    Derived location invariant: ((((((((((a28 <= 9) && (a17 <= 7)) && (a19 <= 0)) || (((a17 <= 7) && (a25 == 0)) && (a19 <= 0))) || (((a17 == 8) && (a11 <= 0)) && (a19 <= 0))) || (((a17 == 8) && (a11 <= 0)) && (a19 == 1))) || ((((a28 <= 9) && (a11 == 1)) && (a17 <= 8)) && (a19 <= 0))) || (((a28 <= 9) && (a17 <= 7)) && (a19 == 1))) || ((((a11 == 1) && (a17 <= 7)) && (a19 == 1)) && (a25 == 0))) || (((a17 == 8) && (a11 == 1)) && (a19 == 1)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:49:18,422 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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