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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label28.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 b0a5cf50440c9e896d19b51bcdf6c9c62935ca0e3dc457582cf7d4a77a7eac75
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 14:07:33,143 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 14:07:33,190 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 14:07:33,193 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 14:07:33,193 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 14:07:33,206 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 14:07:33,207 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 14:07:33,207 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 14:07:33,207 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 14:07:33,207 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 14:07:33,207 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 14:07:33,207 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 14:07:33,207 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 14:07:33,207 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 14:07:33,207 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 14:07:33,209 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 14:07:33,209 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 14:07:33,209 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 14:07:33,209 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 14:07:33,210 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 14:07:33,211 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:07:33,211 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 14:07:33,211 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 14:07:33,212 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 14:07:33,212 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 -> b0a5cf50440c9e896d19b51bcdf6c9c62935ca0e3dc457582cf7d4a77a7eac75
[2025-03-16 14:07:33,436 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 14:07:33,440 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 14:07:33,442 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 14:07:33,442 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 14:07:33,443 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 14:07:33,443 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label28.c
[2025-03-16 14:07:34,584 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4eb6ed/ee6710385f61428d9f649d67986e2e87/FLAGce37d4c90
[2025-03-16 14:07:34,886 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 14:07:34,891 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label28.c
[2025-03-16 14:07:34,907 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4eb6ed/ee6710385f61428d9f649d67986e2e87/FLAGce37d4c90
[2025-03-16 14:07:35,138 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4eb6ed/ee6710385f61428d9f649d67986e2e87
[2025-03-16 14:07:35,139 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 14:07:35,140 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 14:07:35,141 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 14:07:35,142 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 14:07:35,145 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 14:07:35,146 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,146 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4be6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35, skipping insertion in model container
[2025-03-16 14:07:35,146 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,173 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 14:07:35,379 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/Problem01_label28.c[17117,17130]
[2025-03-16 14:07:35,415 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:07:35,426 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 14:07:35,484 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/Problem01_label28.c[17117,17130]
[2025-03-16 14:07:35,498 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 14:07:35,510 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 14:07:35,511 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35 WrapperNode
[2025-03-16 14:07:35,511 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 14:07:35,512 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 14:07:35,512 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 14:07:35,513 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 14:07:35,516 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,526 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,555 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655
[2025-03-16 14:07:35,559 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 14:07:35,559 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 14:07:35,559 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 14:07:35,561 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 14:07:35,567 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,567 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,570 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,587 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-16 14:07:35,587 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,587 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,598 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,600 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,601 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,606 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,613 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 14:07:35,614 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 14:07:35,614 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 14:07:35,614 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 14:07:35,615 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (1/1) ...
[2025-03-16 14:07:35,619 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 14:07:35,628 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:07:35,641 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 14:07:35,643 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 14:07:35,661 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 14:07:35,662 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 14:07:35,662 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 14:07:35,662 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 14:07:35,714 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 14:07:35,715 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 14:07:36,318 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2025-03-16 14:07:36,318 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 14:07:36,331 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 14:07:36,331 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 14:07:36,331 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:36 BoogieIcfgContainer
[2025-03-16 14:07:36,331 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 14:07:36,333 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 14:07:36,333 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 14:07:36,337 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 14:07:36,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:07:35" (1/3) ...
[2025-03-16 14:07:36,337 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bda307e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:36, skipping insertion in model container
[2025-03-16 14:07:36,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:35" (2/3) ...
[2025-03-16 14:07:36,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bda307e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:36, skipping insertion in model container
[2025-03-16 14:07:36,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:36" (3/3) ...
[2025-03-16 14:07:36,339 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem01_label28.c
[2025-03-16 14:07:36,349 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 14:07:36,351 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label28.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 14:07:36,397 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 14:07:36,407 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;@373af1fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 14:07:36,408 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 14:07:36,411 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:36,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-03-16 14:07:36,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:36,418 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]
[2025-03-16 14:07:36,419 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:36,422 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:36,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -1211349089, now seen corresponding path program 1 times
[2025-03-16 14:07:36,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:36,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610678100]
[2025-03-16 14:07:36,427 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:36,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:36,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-03-16 14:07:36,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-03-16 14:07:36,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:36,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:36,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:07:36,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:36,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610678100]
[2025-03-16 14:07:36,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610678100] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:36,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:36,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:07:36,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964871710]
[2025-03-16 14:07:36,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:36,714 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 14:07:36,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:36,728 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 14:07:36,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:07:36,730 INFO  L87              Difference]: Start difference. First operand  has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:36,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:36,747 INFO  L93              Difference]: Finished difference Result 273 states and 529 transitions.
[2025-03-16 14:07:36,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 14:07:36,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92
[2025-03-16 14:07:36,749 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:36,755 INFO  L225             Difference]: With dead ends: 273
[2025-03-16 14:07:36,755 INFO  L226             Difference]: Without dead ends: 134
[2025-03-16 14:07:36,758 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 14:07:36,760 INFO  L435           NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:36,760 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 14:07:36,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-03-16 14:07:36,780 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2025-03-16 14:07:36,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:36,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions.
[2025-03-16 14:07:36,790 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 92
[2025-03-16 14:07:36,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:36,792 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 200 transitions.
[2025-03-16 14:07:36,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:36,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions.
[2025-03-16 14:07:36,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-03-16 14:07:36,795 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:36,795 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]
[2025-03-16 14:07:36,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 14:07:36,798 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:36,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:36,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 790735392, now seen corresponding path program 1 times
[2025-03-16 14:07:36,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:36,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573621354]
[2025-03-16 14:07:36,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:36,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:36,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-03-16 14:07:36,839 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-03-16 14:07:36,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:36,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:36,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:07:36,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:36,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573621354]
[2025-03-16 14:07:36,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573621354] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:36,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:36,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:07:36,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328653220]
[2025-03-16 14:07:36,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:36,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:36,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:36,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:36,991 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:36,991 INFO  L87              Difference]: Start difference. First operand 134 states and 200 transitions. Second operand  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:37,439 INFO  L93              Difference]: Finished difference Result 398 states and 597 transitions.
[2025-03-16 14:07:37,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:37,439 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92
[2025-03-16 14:07:37,440 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:37,441 INFO  L225             Difference]: With dead ends: 398
[2025-03-16 14:07:37,441 INFO  L226             Difference]: Without dead ends: 265
[2025-03-16 14:07:37,441 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:37,442 INFO  L435           NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:37,442 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:37,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2025-03-16 14:07:37,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265.
[2025-03-16 14:07:37,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions.
[2025-03-16 14:07:37,456 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 92
[2025-03-16 14:07:37,458 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:37,458 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 379 transitions.
[2025-03-16 14:07:37,458 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions.
[2025-03-16 14:07:37,461 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-16 14:07:37,461 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:37,461 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:37,461 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 14:07:37,461 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:37,461 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:37,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 374895622, now seen corresponding path program 1 times
[2025-03-16 14:07:37,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:37,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341528057]
[2025-03-16 14:07:37,462 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:37,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:37,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-16 14:07:37,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-16 14:07:37,481 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:37,481 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:37,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:07:37,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:37,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341528057]
[2025-03-16 14:07:37,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341528057] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:37,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:37,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 14:07:37,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59174974]
[2025-03-16 14:07:37,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:37,541 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:37,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:37,542 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:37,542 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:37,542 INFO  L87              Difference]: Start difference. First operand 265 states and 379 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:37,909 INFO  L93              Difference]: Finished difference Result 791 states and 1134 transitions.
[2025-03-16 14:07:37,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:37,910 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98
[2025-03-16 14:07:37,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:37,912 INFO  L225             Difference]: With dead ends: 791
[2025-03-16 14:07:37,912 INFO  L226             Difference]: Without dead ends: 527
[2025-03-16 14:07:37,913 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:37,913 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:37,913 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 35 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:37,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2025-03-16 14:07:37,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527.
[2025-03-16 14:07:37,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions.
[2025-03-16 14:07:37,938 INFO  L78                 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 98
[2025-03-16 14:07:37,939 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:37,939 INFO  L471      AbstractCegarLoop]: Abstraction has 527 states and 708 transitions.
[2025-03-16 14:07:37,940 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:37,940 INFO  L276                IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions.
[2025-03-16 14:07:37,942 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-16 14:07:37,942 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:37,942 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-16 14:07:37,942 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 14:07:37,942 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:37,943 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:37,943 INFO  L85        PathProgramCache]: Analyzing trace with hash 1528239161, now seen corresponding path program 1 times
[2025-03-16 14:07:37,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:37,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549897388]
[2025-03-16 14:07:37,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:37,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:37,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-16 14:07:37,980 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-16 14:07:37,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:37,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:38,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 14:07:38,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:38,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549897388]
[2025-03-16 14:07:38,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549897388] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:38,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:38,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 14:07:38,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979173477]
[2025-03-16 14:07:38,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:38,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 14:07:38,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:38,241 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 14:07:38,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 14:07:38,241 INFO  L87              Difference]: Start difference. First operand 527 states and 708 transitions. Second operand  has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:39,058 INFO  L93              Difference]: Finished difference Result 1970 states and 2605 transitions.
[2025-03-16 14:07:39,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 14:07:39,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-16 14:07:39,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:39,065 INFO  L225             Difference]: With dead ends: 1970
[2025-03-16 14:07:39,065 INFO  L226             Difference]: Without dead ends: 1313
[2025-03-16 14:07:39,067 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-16 14:07:39,068 INFO  L435           NwaCegarLoop]: 17 mSDtfsCounter, 572 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:39,068 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 35 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-16 14:07:39,080 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1313 states.
[2025-03-16 14:07:39,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1051.
[2025-03-16 14:07:39,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1051 states, 1050 states have (on average 1.2180952380952381) internal successors, (1279), 1050 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1279 transitions.
[2025-03-16 14:07:39,108 INFO  L78                 Accepts]: Start accepts. Automaton has 1051 states and 1279 transitions. Word has length 99
[2025-03-16 14:07:39,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:39,108 INFO  L471      AbstractCegarLoop]: Abstraction has 1051 states and 1279 transitions.
[2025-03-16 14:07:39,108 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,108 INFO  L276                IsEmpty]: Start isEmpty. Operand 1051 states and 1279 transitions.
[2025-03-16 14:07:39,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-16 14:07:39,115 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:39,115 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:39,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 14:07:39,116 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:39,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:39,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 95831723, now seen corresponding path program 1 times
[2025-03-16 14:07:39,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:39,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618645909]
[2025-03-16 14:07:39,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:39,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:39,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-16 14:07:39,151 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-16 14:07:39,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:39,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:39,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-16 14:07:39,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:39,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618645909]
[2025-03-16 14:07:39,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618645909] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:39,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:39,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:39,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691976987]
[2025-03-16 14:07:39,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:39,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:07:39,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:39,291 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:07:39,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:39,291 INFO  L87              Difference]: Start difference. First operand 1051 states and 1279 transitions. Second operand  has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:39,755 INFO  L93              Difference]: Finished difference Result 2887 states and 3567 transitions.
[2025-03-16 14:07:39,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:07:39,756 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 122
[2025-03-16 14:07:39,756 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:39,761 INFO  L225             Difference]: With dead ends: 2887
[2025-03-16 14:07:39,761 INFO  L226             Difference]: Without dead ends: 1837
[2025-03-16 14:07:39,763 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:39,763 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 379 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:39,764 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 33 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:39,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1837 states.
[2025-03-16 14:07:39,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837.
[2025-03-16 14:07:39,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1837 states, 1836 states have (on average 1.1857298474945535) internal successors, (2177), 1836 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2177 transitions.
[2025-03-16 14:07:39,800 INFO  L78                 Accepts]: Start accepts. Automaton has 1837 states and 2177 transitions. Word has length 122
[2025-03-16 14:07:39,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:39,800 INFO  L471      AbstractCegarLoop]: Abstraction has 1837 states and 2177 transitions.
[2025-03-16 14:07:39,800 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:39,800 INFO  L276                IsEmpty]: Start isEmpty. Operand 1837 states and 2177 transitions.
[2025-03-16 14:07:39,803 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-03-16 14:07:39,803 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:39,803 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:39,803 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 14:07:39,804 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:39,806 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:39,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -150412874, now seen corresponding path program 2 times
[2025-03-16 14:07:39,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:39,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331792996]
[2025-03-16 14:07:39,806 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-16 14:07:39,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:39,834 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes.
[2025-03-16 14:07:39,853 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 137 of 137 statements.
[2025-03-16 14:07:39,853 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-16 14:07:39,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:39,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-16 14:07:39,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:39,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331792996]
[2025-03-16 14:07:39,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331792996] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:39,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:39,990 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 14:07:39,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326801588]
[2025-03-16 14:07:39,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:39,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:07:39,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:39,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:07:39,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:39,993 INFO  L87              Difference]: Start difference. First operand 1837 states and 2177 transitions. Second operand  has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:40,418 INFO  L93              Difference]: Finished difference Result 4066 states and 4856 transitions.
[2025-03-16 14:07:40,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:07:40,418 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 137
[2025-03-16 14:07:40,418 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:40,424 INFO  L225             Difference]: With dead ends: 4066
[2025-03-16 14:07:40,424 INFO  L226             Difference]: Without dead ends: 2230
[2025-03-16 14:07:40,426 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:40,426 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:40,427 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 35 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:40,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2230 states.
[2025-03-16 14:07:40,446 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1444.
[2025-03-16 14:07:40,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1444 states, 1443 states have (on average 1.1836451836451836) internal successors, (1708), 1443 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1708 transitions.
[2025-03-16 14:07:40,451 INFO  L78                 Accepts]: Start accepts. Automaton has 1444 states and 1708 transitions. Word has length 137
[2025-03-16 14:07:40,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:40,451 INFO  L471      AbstractCegarLoop]: Abstraction has 1444 states and 1708 transitions.
[2025-03-16 14:07:40,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,452 INFO  L276                IsEmpty]: Start isEmpty. Operand 1444 states and 1708 transitions.
[2025-03-16 14:07:40,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2025-03-16 14:07:40,454 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:40,454 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:40,454 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 14:07:40,454 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:40,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:40,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -2110929085, now seen corresponding path program 1 times
[2025-03-16 14:07:40,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:40,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136066135]
[2025-03-16 14:07:40,455 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:40,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:40,471 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes.
[2025-03-16 14:07:40,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements.
[2025-03-16 14:07:40,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:40,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:40,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-03-16 14:07:40,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:40,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136066135]
[2025-03-16 14:07:40,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136066135] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:40,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:40,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:40,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144121292]
[2025-03-16 14:07:40,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:40,586 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:40,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:40,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:40,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:40,587 INFO  L87              Difference]: Start difference. First operand 1444 states and 1708 transitions. Second operand  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,876 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:40,876 INFO  L93              Difference]: Finished difference Result 2887 states and 3415 transitions.
[2025-03-16 14:07:40,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:40,877 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 155
[2025-03-16 14:07:40,877 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:40,880 INFO  L225             Difference]: With dead ends: 2887
[2025-03-16 14:07:40,881 INFO  L226             Difference]: Without dead ends: 1444
[2025-03-16 14:07:40,882 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:40,883 INFO  L435           NwaCegarLoop]: 39 mSDtfsCounter, 114 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:40,883 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:40,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1444 states.
[2025-03-16 14:07:40,902 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444.
[2025-03-16 14:07:40,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1444 states, 1443 states have (on average 1.1767151767151767) internal successors, (1698), 1443 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1698 transitions.
[2025-03-16 14:07:40,908 INFO  L78                 Accepts]: Start accepts. Automaton has 1444 states and 1698 transitions. Word has length 155
[2025-03-16 14:07:40,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:40,908 INFO  L471      AbstractCegarLoop]: Abstraction has 1444 states and 1698 transitions.
[2025-03-16 14:07:40,908 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:40,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 1444 states and 1698 transitions.
[2025-03-16 14:07:40,911 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-16 14:07:40,911 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:40,911 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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]
[2025-03-16 14:07:40,911 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 14:07:40,912 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:40,913 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:40,913 INFO  L85        PathProgramCache]: Analyzing trace with hash 1835593828, now seen corresponding path program 1 times
[2025-03-16 14:07:40,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:40,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046121588]
[2025-03-16 14:07:40,913 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:40,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:40,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-16 14:07:40,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-16 14:07:40,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:40,944 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:41,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-03-16 14:07:41,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:41,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046121588]
[2025-03-16 14:07:41,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046121588] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:41,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:41,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 14:07:41,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472086592]
[2025-03-16 14:07:41,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:41,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:07:41,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:41,073 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:07:41,073 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:41,074 INFO  L87              Difference]: Start difference. First operand 1444 states and 1698 transitions. Second operand  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:41,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:41,517 INFO  L93              Difference]: Finished difference Result 3411 states and 3968 transitions.
[2025-03-16 14:07:41,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:07:41,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 171
[2025-03-16 14:07:41,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:41,522 INFO  L225             Difference]: With dead ends: 3411
[2025-03-16 14:07:41,522 INFO  L226             Difference]: Without dead ends: 1837
[2025-03-16 14:07:41,523 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:41,524 INFO  L435           NwaCegarLoop]: 29 mSDtfsCounter, 244 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:41,524 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 39 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:41,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1837 states.
[2025-03-16 14:07:41,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837.
[2025-03-16 14:07:41,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1837 states, 1836 states have (on average 1.142156862745098) internal successors, (2097), 1836 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:41,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2097 transitions.
[2025-03-16 14:07:41,546 INFO  L78                 Accepts]: Start accepts. Automaton has 1837 states and 2097 transitions. Word has length 171
[2025-03-16 14:07:41,547 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:41,547 INFO  L471      AbstractCegarLoop]: Abstraction has 1837 states and 2097 transitions.
[2025-03-16 14:07:41,547 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:41,547 INFO  L276                IsEmpty]: Start isEmpty. Operand 1837 states and 2097 transitions.
[2025-03-16 14:07:41,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2025-03-16 14:07:41,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:41,550 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:41,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 14:07:41,550 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:41,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:41,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 169683616, now seen corresponding path program 1 times
[2025-03-16 14:07:41,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:41,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625184292]
[2025-03-16 14:07:41,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:41,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:41,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes.
[2025-03-16 14:07:41,580 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements.
[2025-03-16 14:07:41,581 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:41,581 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:41,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-03-16 14:07:41,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:41,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625184292]
[2025-03-16 14:07:41,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625184292] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:41,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:41,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:41,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403277023]
[2025-03-16 14:07:41,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:41,704 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:41,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:41,704 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:41,705 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:41,705 INFO  L87              Difference]: Start difference. First operand 1837 states and 2097 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:41,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:41,974 INFO  L93              Difference]: Finished difference Result 3935 states and 4466 transitions.
[2025-03-16 14:07:41,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:41,974 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 188
[2025-03-16 14:07:41,974 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:41,979 INFO  L225             Difference]: With dead ends: 3935
[2025-03-16 14:07:41,980 INFO  L226             Difference]: Without dead ends: 2099
[2025-03-16 14:07:41,981 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:41,982 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:41,982 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 14:07:41,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2025-03-16 14:07:42,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837.
[2025-03-16 14:07:42,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1837 states, 1836 states have (on average 1.1394335511982572) internal successors, (2092), 1836 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:42,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2092 transitions.
[2025-03-16 14:07:42,008 INFO  L78                 Accepts]: Start accepts. Automaton has 1837 states and 2092 transitions. Word has length 188
[2025-03-16 14:07:42,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:42,008 INFO  L471      AbstractCegarLoop]: Abstraction has 1837 states and 2092 transitions.
[2025-03-16 14:07:42,008 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:42,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 1837 states and 2092 transitions.
[2025-03-16 14:07:42,011 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-16 14:07:42,011 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:42,012 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:42,012 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 14:07:42,012 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:42,012 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:42,012 INFO  L85        PathProgramCache]: Analyzing trace with hash 753498242, now seen corresponding path program 1 times
[2025-03-16 14:07:42,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:42,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253558934]
[2025-03-16 14:07:42,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:42,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:42,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-16 14:07:42,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-16 14:07:42,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:42,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:42,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 323 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked.
[2025-03-16 14:07:42,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:42,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253558934]
[2025-03-16 14:07:42,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253558934] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:42,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:42,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:42,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854926106]
[2025-03-16 14:07:42,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:42,193 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 14:07:42,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:42,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 14:07:42,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:42,194 INFO  L87              Difference]: Start difference. First operand 1837 states and 2092 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:42,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:42,590 INFO  L93              Difference]: Finished difference Result 3804 states and 4333 transitions.
[2025-03-16 14:07:42,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 14:07:42,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 213
[2025-03-16 14:07:42,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:42,596 INFO  L225             Difference]: With dead ends: 3804
[2025-03-16 14:07:42,596 INFO  L226             Difference]: Without dead ends: 1968
[2025-03-16 14:07:42,598 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 14:07:42,598 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 371 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:42,598 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 41 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 14:07:42,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1968 states.
[2025-03-16 14:07:42,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1968.
[2025-03-16 14:07:42,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1968 states, 1967 states have (on average 1.1331977630910015) internal successors, (2229), 1967 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:42,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2229 transitions.
[2025-03-16 14:07:42,646 INFO  L78                 Accepts]: Start accepts. Automaton has 1968 states and 2229 transitions. Word has length 213
[2025-03-16 14:07:42,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:42,646 INFO  L471      AbstractCegarLoop]: Abstraction has 1968 states and 2229 transitions.
[2025-03-16 14:07:42,646 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:42,646 INFO  L276                IsEmpty]: Start isEmpty. Operand 1968 states and 2229 transitions.
[2025-03-16 14:07:42,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-16 14:07:42,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:42,651 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:42,651 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 14:07:42,651 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:42,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:42,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -999289254, now seen corresponding path program 1 times
[2025-03-16 14:07:42,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:42,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147992358]
[2025-03-16 14:07:42,652 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:42,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:42,680 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-16 14:07:42,692 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-16 14:07:42,692 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:42,692 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:42,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-03-16 14:07:42,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:42,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147992358]
[2025-03-16 14:07:42,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147992358] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:42,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:42,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:42,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026427596]
[2025-03-16 14:07:42,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:42,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:42,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:42,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:42,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:42,809 INFO  L87              Difference]: Start difference. First operand 1968 states and 2229 transitions. Second operand  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:43,089 INFO  L93              Difference]: Finished difference Result 4197 states and 4730 transitions.
[2025-03-16 14:07:43,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:43,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-03-16 14:07:43,090 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:43,096 INFO  L225             Difference]: With dead ends: 4197
[2025-03-16 14:07:43,096 INFO  L226             Difference]: Without dead ends: 2230
[2025-03-16 14:07:43,099 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:43,100 INFO  L435           NwaCegarLoop]: 171 mSDtfsCounter, 88 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:43,100 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 175 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:43,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2230 states.
[2025-03-16 14:07:43,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2099.
[2025-03-16 14:07:43,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2099 states, 2098 states have (on average 1.1163012392755005) internal successors, (2342), 2098 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2342 transitions.
[2025-03-16 14:07:43,130 INFO  L78                 Accepts]: Start accepts. Automaton has 2099 states and 2342 transitions. Word has length 231
[2025-03-16 14:07:43,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:43,130 INFO  L471      AbstractCegarLoop]: Abstraction has 2099 states and 2342 transitions.
[2025-03-16 14:07:43,130 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,130 INFO  L276                IsEmpty]: Start isEmpty. Operand 2099 states and 2342 transitions.
[2025-03-16 14:07:43,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-16 14:07:43,134 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:43,135 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:43,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 14:07:43,135 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:43,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:43,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 1808847105, now seen corresponding path program 1 times
[2025-03-16 14:07:43,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:43,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022821967]
[2025-03-16 14:07:43,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:43,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:43,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-16 14:07:43,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-16 14:07:43,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:43,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:43,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 390 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked.
[2025-03-16 14:07:43,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:43,263 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022821967]
[2025-03-16 14:07:43,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022821967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:43,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:43,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:43,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459543591]
[2025-03-16 14:07:43,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:43,263 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:43,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:43,264 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:43,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:43,264 INFO  L87              Difference]: Start difference. First operand 2099 states and 2342 transitions. Second operand  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:43,538 INFO  L93              Difference]: Finished difference Result 4197 states and 4683 transitions.
[2025-03-16 14:07:43,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:43,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 244
[2025-03-16 14:07:43,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:43,545 INFO  L225             Difference]: With dead ends: 4197
[2025-03-16 14:07:43,546 INFO  L226             Difference]: Without dead ends: 2099
[2025-03-16 14:07:43,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:43,549 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:43,550 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 161 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:43,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2025-03-16 14:07:43,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099.
[2025-03-16 14:07:43,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2099 states, 2098 states have (on average 1.09580552907531) internal successors, (2299), 2098 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2299 transitions.
[2025-03-16 14:07:43,582 INFO  L78                 Accepts]: Start accepts. Automaton has 2099 states and 2299 transitions. Word has length 244
[2025-03-16 14:07:43,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:43,582 INFO  L471      AbstractCegarLoop]: Abstraction has 2099 states and 2299 transitions.
[2025-03-16 14:07:43,582 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:43,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 2099 states and 2299 transitions.
[2025-03-16 14:07:43,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-16 14:07:43,587 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:43,587 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:43,588 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 14:07:43,588 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:43,588 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:43,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272875377, now seen corresponding path program 1 times
[2025-03-16 14:07:43,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:43,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367658288]
[2025-03-16 14:07:43,588 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:43,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:43,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-16 14:07:43,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-16 14:07:43,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:43,630 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:44,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 233 proven. 135 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 14:07:44,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:44,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367658288]
[2025-03-16 14:07:44,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367658288] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:07:44,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509943173]
[2025-03-16 14:07:44,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:44,041 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:07:44,041 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:07:44,043 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:07:44,044 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 14:07:44,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-16 14:07:44,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-16 14:07:44,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:44,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:44,171 INFO  L256         TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:07:44,176 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:07:44,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-16 14:07:44,229 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:07:44,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509943173] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:44,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:07:44,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2025-03-16 14:07:44,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893980918]
[2025-03-16 14:07:44,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:44,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:44,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:44,230 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:44,230 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 14:07:44,230 INFO  L87              Difference]: Start difference. First operand 2099 states and 2299 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-16 14:07:44,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:44,523 INFO  L93              Difference]: Finished difference Result 4852 states and 5313 transitions.
[2025-03-16 14:07:44,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:44,524 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 253
[2025-03-16 14:07:44,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:44,530 INFO  L225             Difference]: With dead ends: 4852
[2025-03-16 14:07:44,530 INFO  L226             Difference]: Without dead ends: 2754
[2025-03-16 14:07:44,532 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 14:07:44,533 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:44,533 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 28 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:44,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2754 states.
[2025-03-16 14:07:44,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2230.
[2025-03-16 14:07:44,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2230 states, 2229 states have (on average 1.1000448631673396) internal successors, (2452), 2229 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:44,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2452 transitions.
[2025-03-16 14:07:44,566 INFO  L78                 Accepts]: Start accepts. Automaton has 2230 states and 2452 transitions. Word has length 253
[2025-03-16 14:07:44,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:44,566 INFO  L471      AbstractCegarLoop]: Abstraction has 2230 states and 2452 transitions.
[2025-03-16 14:07:44,566 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-16 14:07:44,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 2230 states and 2452 transitions.
[2025-03-16 14:07:44,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-16 14:07:44,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:44,570 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-16 14:07:44,577 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-16 14:07:44,771 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-16 14:07:44,771 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:44,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:44,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967228359, now seen corresponding path program 1 times
[2025-03-16 14:07:44,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:44,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491953268]
[2025-03-16 14:07:44,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:44,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:44,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-16 14:07:44,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-16 14:07:44,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:44,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:44,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 359 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2025-03-16 14:07:44,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:44,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491953268]
[2025-03-16 14:07:44,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491953268] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:44,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 14:07:44,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 14:07:44,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030970371]
[2025-03-16 14:07:44,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:44,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:44,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:44,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:44,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:44,904 INFO  L87              Difference]: Start difference. First operand 2230 states and 2452 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:45,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:45,214 INFO  L93              Difference]: Finished difference Result 4983 states and 5473 transitions.
[2025-03-16 14:07:45,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:45,214 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 256
[2025-03-16 14:07:45,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:45,220 INFO  L225             Difference]: With dead ends: 4983
[2025-03-16 14:07:45,220 INFO  L226             Difference]: Without dead ends: 2754
[2025-03-16 14:07:45,222 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 14:07:45,222 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:45,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 28 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:45,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2754 states.
[2025-03-16 14:07:45,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2230.
[2025-03-16 14:07:45,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2230 states, 2229 states have (on average 1.0933153880663975) internal successors, (2437), 2229 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:45,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2437 transitions.
[2025-03-16 14:07:45,256 INFO  L78                 Accepts]: Start accepts. Automaton has 2230 states and 2437 transitions. Word has length 256
[2025-03-16 14:07:45,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:45,257 INFO  L471      AbstractCegarLoop]: Abstraction has 2230 states and 2437 transitions.
[2025-03-16 14:07:45,257 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:45,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 2230 states and 2437 transitions.
[2025-03-16 14:07:45,262 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-03-16 14:07:45,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 14:07:45,262 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:45,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 14:07:45,263 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 14:07:45,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 14:07:45,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -22586984, now seen corresponding path program 1 times
[2025-03-16 14:07:45,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 14:07:45,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204789764]
[2025-03-16 14:07:45,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:45,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 14:07:45,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-16 14:07:45,312 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-16 14:07:45,312 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:45,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:45,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 14:07:45,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 14:07:45,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204789764]
[2025-03-16 14:07:45,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204789764] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 14:07:45,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265292784]
[2025-03-16 14:07:45,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 14:07:45,692 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 14:07:45,692 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 14:07:45,696 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 14:07:45,697 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 14:07:45,747 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-16 14:07:45,805 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-16 14:07:45,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 14:07:45,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 14:07:45,808 INFO  L256         TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 14:07:45,816 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 14:07:45,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-03-16 14:07:45,961 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 14:07:45,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265292784] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 14:07:45,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 14:07:45,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-16 14:07:45,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377167043]
[2025-03-16 14:07:45,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 14:07:45,962 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 14:07:45,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 14:07:45,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 14:07:45,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-16 14:07:45,962 INFO  L87              Difference]: Start difference. First operand 2230 states and 2437 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:46,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 14:07:46,232 INFO  L93              Difference]: Finished difference Result 4457 states and 4872 transitions.
[2025-03-16 14:07:46,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 14:07:46,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262
[2025-03-16 14:07:46,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 14:07:46,233 INFO  L225             Difference]: With dead ends: 4457
[2025-03-16 14:07:46,233 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 14:07:46,236 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-16 14:07:46,236 INFO  L435           NwaCegarLoop]: 163 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 14:07:46,238 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 14:07:46,238 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 14:07:46,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 14:07:46,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:46,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 14:07:46,239 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262
[2025-03-16 14:07:46,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 14:07:46,239 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 14:07:46,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 14:07:46,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 14:07:46,239 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 14:07:46,241 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 14:07:46,249 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-16 14:07:46,446 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-16 14:07:46,448 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 14:07:46,449 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 14:07:46,758 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 14:07:46,771 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:07:46 BoogieIcfgContainer
[2025-03-16 14:07:46,771 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 14:07:46,772 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 14:07:46,772 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 14:07:46,772 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 14:07:46,772 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:36" (3/4) ...
[2025-03-16 14:07:46,774 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 14:07:46,789 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-16 14:07:46,790 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-16 14:07:46,791 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 14:07:46,791 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 14:07:46,890 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 14:07:46,890 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 14:07:46,890 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 14:07:46,891 INFO  L158              Benchmark]: Toolchain (without parser) took 11750.41ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 104.8MB in the beginning and 389.1MB in the end (delta: -284.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,891 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 14:07:46,891 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 370.68ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 77.2MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,891 INFO  L158              Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 71.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,891 INFO  L158              Benchmark]: Boogie Preprocessor took 54.50ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 68.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 14:07:46,892 INFO  L158              Benchmark]: IcfgBuilder took 717.28ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 59.2MB in the end (delta: 9.4MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,892 INFO  L158              Benchmark]: TraceAbstraction took 10438.47ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 59.2MB in the beginning and 401.3MB in the end (delta: -342.1MB). Peak memory consumption was 223.0MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,892 INFO  L158              Benchmark]: Witness Printer took 118.43ms. Allocated memory is still 453.0MB. Free memory was 401.3MB in the beginning and 389.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-16 14:07:46,893 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 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 370.68ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 77.2MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 71.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 54.50ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 68.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 717.28ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 59.2MB in the end (delta: 9.4MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10438.47ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 59.2MB in the beginning and 401.3MB in the end (delta: -342.1MB). Peak memory consumption was 223.0MB. Max. memory is 16.1GB.
 * Witness Printer took 118.43ms. Allocated memory is still 453.0MB. Free memory was 401.3MB in the beginning and 389.1MB in the end (delta: 12.2MB). 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: 465]: 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, 137 locations, 265 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2857 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2857 mSDsluCounter, 1090 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 843 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5676 IncrementalHoareTripleChecker+Invalid, 6519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 843 mSolverCounterUnsat, 995 mSDtfsCounter, 5676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2230occurred in iteration=13, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2489 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3128 NumberOfCodeBlocks, 3128 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3111 ConstructedInterpolants, 0 QuantifiedInterpolants, 9581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 993 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 3332/3609 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: 593]: Location Invariant
    Derived location invariant: (((((((((((((a16 != 6) && (a12 == 8)) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a7 == 1)) && (a20 == 1)) || ((a21 <= 0) && (a20 == 1))) || (((((a7 <= 0) && (a12 == 8)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a16 != 6) && (a21 <= 0)) && (a17 == 1))) || ((a7 != 1) && (a16 <= 4))) || ((a16 != 6) && (14 <= a8))) || ((a7 != 1) && (15 <= a8)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 14:07:46,906 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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