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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label34.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 e946c16a3da25e9b3a559976cb9b3bd2f39939274bf6ba18ec27980a89869469
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:49:16,099 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:49:16,147 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:49:16,151 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:49:16,151 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:49:16,166 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:49:16,167 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:49:16,167 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:49:16,167 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:49:16,167 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:49:16,167 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:49:16,167 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:49:16,168 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:49:16,168 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:49:16,168 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:49:16,168 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:16,169 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:49:16,169 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:49:16,169 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 -> e946c16a3da25e9b3a559976cb9b3bd2f39939274bf6ba18ec27980a89869469
[2025-03-03 09:49:16,365 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:49:16,370 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:49:16,371 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:49:16,371 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:49:16,372 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:49:16,372 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label34.c
[2025-03-03 09:49:17,471 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2d19cce/ac8e51b3ae1848ae9407599e73e34d9f/FLAG4f2091dcd
[2025-03-03 09:49:17,803 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:49:17,805 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label34.c
[2025-03-03 09:49:17,815 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2d19cce/ac8e51b3ae1848ae9407599e73e34d9f/FLAG4f2091dcd
[2025-03-03 09:49:18,056 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2d19cce/ac8e51b3ae1848ae9407599e73e34d9f
[2025-03-03 09:49:18,058 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:49:18,059 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:49:18,060 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:18,060 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:49:18,063 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:49:18,063 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,064 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743c8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18, skipping insertion in model container
[2025-03-03 09:49:18,064 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,094 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:49:18,278 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label34.c[16560,16573]
[2025-03-03 09:49:18,299 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:18,307 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:49:18,372 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label34.c[16560,16573]
[2025-03-03 09:49:18,387 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:49:18,399 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:49:18,400 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18 WrapperNode
[2025-03-03 09:49:18,400 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:49:18,401 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:18,401 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:49:18,401 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:49:18,405 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,419 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,464 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666
[2025-03-03 09:49:18,465 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:49:18,465 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:49:18,466 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:49:18,466 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:49:18,472 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,472 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,480 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,503 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 09:49:18,506 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,507 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,522 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,523 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,528 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,529 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,538 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:49:18,539 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:49:18,539 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:49:18,539 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:49:18,539 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (1/1) ...
[2025-03-03 09:49:18,544 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:49:18,552 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:18,563 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:49:18,564 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:49:18,580 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:49:18,580 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:49:18,580 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:49:18,580 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:49:18,624 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:49:18,625 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:49:19,386 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-03 09:49:19,386 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:49:19,399 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:49:19,399 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:49:19,399 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:19 BoogieIcfgContainer
[2025-03-03 09:49:19,399 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:49:19,401 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:49:19,401 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:49:19,406 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:49:19,407 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:49:18" (1/3) ...
[2025-03-03 09:49:19,407 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79248d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:19, skipping insertion in model container
[2025-03-03 09:49:19,407 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:49:18" (2/3) ...
[2025-03-03 09:49:19,408 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79248d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:49:19, skipping insertion in model container
[2025-03-03 09:49:19,408 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:19" (3/3) ...
[2025-03-03 09:49:19,410 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem02_label34.c
[2025-03-03 09:49:19,420 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:49:19,421 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label34.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:49:19,470 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:49:19,481 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;@4f4a881f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:49:19,482 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:49:19,486 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:19,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-03 09:49:19,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:19,495 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:19,495 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:19,500 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:19,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 1754478449, now seen corresponding path program 1 times
[2025-03-03 09:49:19,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:19,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945269908]
[2025-03-03 09:49:19,506 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:19,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:19,570 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-03 09:49:19,637 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-03 09:49:19,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:19,637 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:19,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:19,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:19,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945269908]
[2025-03-03 09:49:19,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945269908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:19,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:19,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:19,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235099155]
[2025-03-03 09:49:19,894 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:19,896 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:19,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:19,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:19,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:19,911 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 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-03 09:49:20,509 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:20,509 INFO  L93              Difference]: Finished difference Result 601 states and 1032 transitions.
[2025-03-03 09:49:20,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:20,512 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-03 09:49:20,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:20,522 INFO  L225             Difference]: With dead ends: 601
[2025-03-03 09:49:20,523 INFO  L226             Difference]: Without dead ends: 310
[2025-03-03 09:49:20,527 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:20,530 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:20,533 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:49:20,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2025-03-03 09:49:20,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310.
[2025-03-03 09:49:20,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:20,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions.
[2025-03-03 09:49:20,567 INFO  L78                 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 98
[2025-03-03 09:49:20,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:20,567 INFO  L471      AbstractCegarLoop]: Abstraction has 310 states and 444 transitions.
[2025-03-03 09:49:20,568 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-03 09:49:20,568 INFO  L276                IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions.
[2025-03-03 09:49:20,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-03-03 09:49:20,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:20,570 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:20,571 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:49:20,571 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:20,571 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:20,571 INFO  L85        PathProgramCache]: Analyzing trace with hash 880553196, now seen corresponding path program 1 times
[2025-03-03 09:49:20,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:20,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348687858]
[2025-03-03 09:49:20,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:20,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:20,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-03 09:49:20,598 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-03 09:49:20,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:20,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:20,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:20,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:20,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348687858]
[2025-03-03 09:49:20,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348687858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:20,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:20,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:20,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955459798]
[2025-03-03 09:49:20,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:20,781 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:20,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:20,782 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:20,782 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:20,782 INFO  L87              Difference]: Start difference. First operand 310 states and 444 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-03 09:49:21,154 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:21,155 INFO  L93              Difference]: Finished difference Result 913 states and 1314 transitions.
[2025-03-03 09:49:21,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:21,155 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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 116
[2025-03-03 09:49:21,155 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:21,158 INFO  L225             Difference]: With dead ends: 913
[2025-03-03 09:49:21,158 INFO  L226             Difference]: Without dead ends: 605
[2025-03-03 09:49:21,158 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:21,159 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:21,159 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 97 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:49:21,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2025-03-03 09:49:21,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 598.
[2025-03-03 09:49:21,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 598 states, 597 states have (on average 1.3969849246231156) internal successors, (834), 597 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:21,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 834 transitions.
[2025-03-03 09:49:21,183 INFO  L78                 Accepts]: Start accepts. Automaton has 598 states and 834 transitions. Word has length 116
[2025-03-03 09:49:21,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:21,183 INFO  L471      AbstractCegarLoop]: Abstraction has 598 states and 834 transitions.
[2025-03-03 09:49:21,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-03 09:49:21,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions.
[2025-03-03 09:49:21,186 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-03 09:49:21,186 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:21,186 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:21,188 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:49:21,189 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:21,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:21,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -1270031994, now seen corresponding path program 1 times
[2025-03-03 09:49:21,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:21,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325597593]
[2025-03-03 09:49:21,190 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:21,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:21,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-03 09:49:21,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-03 09:49:21,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:21,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:21,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:21,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:21,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325597593]
[2025-03-03 09:49:21,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325597593] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:21,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:21,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:21,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458348990]
[2025-03-03 09:49:21,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:21,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:21,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:21,314 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:21,315 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:21,315 INFO  L87              Difference]: Start difference. First operand 598 states and 834 transitions. Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:21,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:21,711 INFO  L93              Difference]: Finished difference Result 1773 states and 2478 transitions.
[2025-03-03 09:49:21,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:21,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117
[2025-03-03 09:49:21,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:21,716 INFO  L225             Difference]: With dead ends: 1773
[2025-03-03 09:49:21,716 INFO  L226             Difference]: Without dead ends: 1177
[2025-03-03 09:49:21,718 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:21,719 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 187 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:21,719 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:49:21,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1177 states.
[2025-03-03 09:49:21,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175.
[2025-03-03 09:49:21,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1175 states, 1174 states have (on average 1.3475298126064736) internal successors, (1582), 1174 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:21,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1582 transitions.
[2025-03-03 09:49:21,747 INFO  L78                 Accepts]: Start accepts. Automaton has 1175 states and 1582 transitions. Word has length 117
[2025-03-03 09:49:21,747 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:21,747 INFO  L471      AbstractCegarLoop]: Abstraction has 1175 states and 1582 transitions.
[2025-03-03 09:49:21,747 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:21,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 1175 states and 1582 transitions.
[2025-03-03 09:49:21,754 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-03 09:49:21,754 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:21,754 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:21,754 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:49:21,754 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:21,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:21,755 INFO  L85        PathProgramCache]: Analyzing trace with hash 190783823, now seen corresponding path program 1 times
[2025-03-03 09:49:21,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:21,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885725280]
[2025-03-03 09:49:21,755 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:21,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:21,772 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-03 09:49:21,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-03 09:49:21,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:21,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:21,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:21,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:21,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885725280]
[2025-03-03 09:49:21,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885725280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:21,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:21,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:21,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118843090]
[2025-03-03 09:49:21,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:21,848 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:21,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:21,849 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:21,849 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:21,849 INFO  L87              Difference]: Start difference. First operand 1175 states and 1582 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:22,230 INFO  L93              Difference]: Finished difference Result 3468 states and 4676 transitions.
[2025-03-03 09:49:22,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:22,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120
[2025-03-03 09:49:22,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:22,237 INFO  L225             Difference]: With dead ends: 3468
[2025-03-03 09:49:22,237 INFO  L226             Difference]: Without dead ends: 2295
[2025-03-03 09:49:22,239 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:22,240 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:22,241 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 88 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:22,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2295 states.
[2025-03-03 09:49:22,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295.
[2025-03-03 09:49:22,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2295 states, 2294 states have (on average 1.2920662598081953) internal successors, (2964), 2294 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2964 transitions.
[2025-03-03 09:49:22,283 INFO  L78                 Accepts]: Start accepts. Automaton has 2295 states and 2964 transitions. Word has length 120
[2025-03-03 09:49:22,284 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:22,284 INFO  L471      AbstractCegarLoop]: Abstraction has 2295 states and 2964 transitions.
[2025-03-03 09:49:22,284 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 2295 states and 2964 transitions.
[2025-03-03 09:49:22,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-03 09:49:22,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:22,287 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:22,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:49:22,287 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:22,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:22,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1178046077, now seen corresponding path program 1 times
[2025-03-03 09:49:22,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:22,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360431318]
[2025-03-03 09:49:22,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:22,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:22,302 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-03 09:49:22,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-03 09:49:22,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:22,308 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:22,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:49:22,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:22,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360431318]
[2025-03-03 09:49:22,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360431318] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:22,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:22,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:22,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224143115]
[2025-03-03 09:49:22,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:22,372 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:22,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:22,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:22,373 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:22,373 INFO  L87              Difference]: Start difference. First operand 2295 states and 2964 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:22,582 INFO  L93              Difference]: Finished difference Result 4433 states and 5722 transitions.
[2025-03-03 09:49:22,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:22,583 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 121
[2025-03-03 09:49:22,583 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:22,591 INFO  L225             Difference]: With dead ends: 4433
[2025-03-03 09:49:22,591 INFO  L226             Difference]: Without dead ends: 2140
[2025-03-03 09:49:22,593 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:22,594 INFO  L435           NwaCegarLoop]: 22 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:22,595 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 22 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:22,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2140 states.
[2025-03-03 09:49:22,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140.
[2025-03-03 09:49:22,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2140 states, 2139 states have (on average 1.2342215988779803) internal successors, (2640), 2139 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2640 transitions.
[2025-03-03 09:49:22,630 INFO  L78                 Accepts]: Start accepts. Automaton has 2140 states and 2640 transitions. Word has length 121
[2025-03-03 09:49:22,630 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:22,630 INFO  L471      AbstractCegarLoop]: Abstraction has 2140 states and 2640 transitions.
[2025-03-03 09:49:22,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:22,631 INFO  L276                IsEmpty]: Start isEmpty. Operand 2140 states and 2640 transitions.
[2025-03-03 09:49:22,633 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-03 09:49:22,634 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:22,634 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:22,634 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:49:22,634 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:22,635 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:22,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 1828538911, now seen corresponding path program 1 times
[2025-03-03 09:49:22,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:22,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448995226]
[2025-03-03 09:49:22,635 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:22,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:22,649 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-03 09:49:22,657 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-03 09:49:22,657 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:22,657 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:22,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:22,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:22,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448995226]
[2025-03-03 09:49:22,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448995226] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:49:22,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753602392]
[2025-03-03 09:49:22,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:22,898 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:22,899 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:22,902 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:49:22,904 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:49:22,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-03 09:49:22,972 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-03 09:49:22,972 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:22,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:22,975 INFO  L256         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:49:22,980 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:49:23,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:49:23,117 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:49:23,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [753602392] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:23,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:49:23,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:49:23,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286957198]
[2025-03-03 09:49:23,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:23,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:23,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:23,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:23,118 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:23,118 INFO  L87              Difference]: Start difference. First operand 2140 states and 2640 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:23,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:23,479 INFO  L93              Difference]: Finished difference Result 4278 states and 5278 transitions.
[2025-03-03 09:49:23,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:23,479 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 125
[2025-03-03 09:49:23,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:23,486 INFO  L225             Difference]: With dead ends: 4278
[2025-03-03 09:49:23,486 INFO  L226             Difference]: Without dead ends: 2140
[2025-03-03 09:49:23,488 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:23,489 INFO  L435           NwaCegarLoop]: 202 mSDtfsCounter, 63 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:23,489 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 214 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:23,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2140 states.
[2025-03-03 09:49:23,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140.
[2025-03-03 09:49:23,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2140 states, 2139 states have (on average 1.1533426834969611) internal successors, (2467), 2139 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:23,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2467 transitions.
[2025-03-03 09:49:23,525 INFO  L78                 Accepts]: Start accepts. Automaton has 2140 states and 2467 transitions. Word has length 125
[2025-03-03 09:49:23,525 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:23,525 INFO  L471      AbstractCegarLoop]: Abstraction has 2140 states and 2467 transitions.
[2025-03-03 09:49:23,525 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:23,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 2140 states and 2467 transitions.
[2025-03-03 09:49:23,528 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-03-03 09:49:23,528 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:23,528 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:23,537 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:49:23,729 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,SelfDestructingSolverStorable5
[2025-03-03 09:49:23,729 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:23,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:23,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -954971046, now seen corresponding path program 1 times
[2025-03-03 09:49:23,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:23,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303290320]
[2025-03-03 09:49:23,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:23,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:23,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-03 09:49:23,757 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-03 09:49:23,758 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:23,758 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:23,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:23,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:23,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303290320]
[2025-03-03 09:49:23,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303290320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:23,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:23,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:23,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101493517]
[2025-03-03 09:49:23,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:23,835 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:23,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:23,836 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:23,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:23,836 INFO  L87              Difference]: Start difference. First operand 2140 states and 2467 transitions. Second operand  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:24,152 INFO  L93              Difference]: Finished difference Result 4553 states and 5236 transitions.
[2025-03-03 09:49:24,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:24,153 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127
[2025-03-03 09:49:24,153 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:24,158 INFO  L225             Difference]: With dead ends: 4553
[2025-03-03 09:49:24,158 INFO  L226             Difference]: Without dead ends: 1852
[2025-03-03 09:49:24,160 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:24,160 INFO  L435           NwaCegarLoop]: 34 mSDtfsCounter, 149 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:24,161 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 40 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:24,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1852 states.
[2025-03-03 09:49:24,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1852.
[2025-03-03 09:49:24,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1852 states, 1851 states have (on average 1.1085899513776336) internal successors, (2052), 1851 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2052 transitions.
[2025-03-03 09:49:24,199 INFO  L78                 Accepts]: Start accepts. Automaton has 1852 states and 2052 transitions. Word has length 127
[2025-03-03 09:49:24,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:24,200 INFO  L471      AbstractCegarLoop]: Abstraction has 1852 states and 2052 transitions.
[2025-03-03 09:49:24,200 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 1852 states and 2052 transitions.
[2025-03-03 09:49:24,201 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-03 09:49:24,201 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:24,202 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:24,202 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 09:49:24,202 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:24,202 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:24,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -1559283568, now seen corresponding path program 1 times
[2025-03-03 09:49:24,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:24,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364250953]
[2025-03-03 09:49:24,202 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:24,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:24,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-03 09:49:24,217 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-03 09:49:24,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:24,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:24,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:24,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:24,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364250953]
[2025-03-03 09:49:24,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364250953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:24,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:24,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:49:24,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593935789]
[2025-03-03 09:49:24,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:24,342 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:49:24,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:24,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:49:24,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:49:24,343 INFO  L87              Difference]: Start difference. First operand 1852 states and 2052 transitions. Second operand  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:24,928 INFO  L93              Difference]: Finished difference Result 3977 states and 4408 transitions.
[2025-03-03 09:49:24,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:49:24,928 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131
[2025-03-03 09:49:24,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:24,936 INFO  L225             Difference]: With dead ends: 3977
[2025-03-03 09:49:24,936 INFO  L226             Difference]: Without dead ends: 2127
[2025-03-03 09:49:24,938 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:24,939 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 325 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:24,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 87 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:49:24,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2127 states.
[2025-03-03 09:49:24,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1707.
[2025-03-03 09:49:24,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1107854630715124) internal successors, (1895), 1706 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1895 transitions.
[2025-03-03 09:49:24,969 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1895 transitions. Word has length 131
[2025-03-03 09:49:24,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:24,969 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1895 transitions.
[2025-03-03 09:49:24,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:24,969 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1895 transitions.
[2025-03-03 09:49:24,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-03 09:49:24,971 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:24,971 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:24,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:49:24,972 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:24,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:24,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 110922735, now seen corresponding path program 1 times
[2025-03-03 09:49:24,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:24,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989990666]
[2025-03-03 09:49:24,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:24,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:24,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-03 09:49:24,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-03 09:49:24,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:24,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:25,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:25,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:25,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989990666]
[2025-03-03 09:49:25,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989990666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:25,033 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:25,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:25,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624519070]
[2025-03-03 09:49:25,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:25,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:25,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:25,033 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:25,033 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:25,033 INFO  L87              Difference]: Start difference. First operand 1707 states and 1895 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:25,327 INFO  L93              Difference]: Finished difference Result 2550 states and 2825 transitions.
[2025-03-03 09:49:25,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:25,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144
[2025-03-03 09:49:25,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:25,329 INFO  L225             Difference]: With dead ends: 2550
[2025-03-03 09:49:25,329 INFO  L226             Difference]: Without dead ends: 714
[2025-03-03 09:49:25,331 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:25,331 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 102 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:25,331 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 212 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:25,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 714 states.
[2025-03-03 09:49:25,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714.
[2025-03-03 09:49:25,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 714 states, 713 states have (on average 1.0841514726507715) internal successors, (773), 713 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 773 transitions.
[2025-03-03 09:49:25,341 INFO  L78                 Accepts]: Start accepts. Automaton has 714 states and 773 transitions. Word has length 144
[2025-03-03 09:49:25,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:25,341 INFO  L471      AbstractCegarLoop]: Abstraction has 714 states and 773 transitions.
[2025-03-03 09:49:25,342 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 714 states and 773 transitions.
[2025-03-03 09:49:25,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-03 09:49:25,343 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:25,343 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:49:25,343 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:49:25,343 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:25,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:25,344 INFO  L85        PathProgramCache]: Analyzing trace with hash -1454044437, now seen corresponding path program 1 times
[2025-03-03 09:49:25,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:25,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499708551]
[2025-03-03 09:49:25,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:25,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:25,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 09:49:25,364 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 09:49:25,365 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:25,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:25,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:25,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:25,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499708551]
[2025-03-03 09:49:25,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499708551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:25,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:25,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:25,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360804611]
[2025-03-03 09:49:25,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:25,422 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:25,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:25,423 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:25,423 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:25,423 INFO  L87              Difference]: Start difference. First operand 714 states and 773 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:25,670 INFO  L93              Difference]: Finished difference Result 1847 states and 2001 transitions.
[2025-03-03 09:49:25,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:25,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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-03 09:49:25,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:25,673 INFO  L225             Difference]: With dead ends: 1847
[2025-03-03 09:49:25,673 INFO  L226             Difference]: Without dead ends: 1135
[2025-03-03 09:49:25,674 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:25,674 INFO  L435           NwaCegarLoop]: 36 mSDtfsCounter, 71 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:25,674 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 45 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:25,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1135 states.
[2025-03-03 09:49:25,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1134.
[2025-03-03 09:49:25,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1134 states, 1133 states have (on average 1.0511915269196823) internal successors, (1191), 1133 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1191 transitions.
[2025-03-03 09:49:25,687 INFO  L78                 Accepts]: Start accepts. Automaton has 1134 states and 1191 transitions. Word has length 171
[2025-03-03 09:49:25,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:25,687 INFO  L471      AbstractCegarLoop]: Abstraction has 1134 states and 1191 transitions.
[2025-03-03 09:49:25,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:25,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 1134 states and 1191 transitions.
[2025-03-03 09:49:25,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-03 09:49:25,689 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:25,689 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:49:25,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:49:25,690 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:25,690 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:25,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -1196491744, now seen corresponding path program 1 times
[2025-03-03 09:49:25,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:25,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970288994]
[2025-03-03 09:49:25,690 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:25,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:25,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-03 09:49:25,729 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-03 09:49:25,729 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:25,729 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:25,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:49:25,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:25,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970288994]
[2025-03-03 09:49:25,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970288994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:25,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:25,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:25,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486260552]
[2025-03-03 09:49:25,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:25,809 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:25,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:25,809 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:25,809 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:25,809 INFO  L87              Difference]: Start difference. First operand 1134 states and 1191 transitions. Second operand  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:26,030 INFO  L93              Difference]: Finished difference Result 1986 states and 2092 transitions.
[2025-03-03 09:49:26,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:26,031 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218
[2025-03-03 09:49:26,031 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:26,032 INFO  L225             Difference]: With dead ends: 1986
[2025-03-03 09:49:26,032 INFO  L226             Difference]: Without dead ends: 853
[2025-03-03 09:49:26,033 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:26,034 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:26,034 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 196 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:26,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 853 states.
[2025-03-03 09:49:26,040 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 852.
[2025-03-03 09:49:26,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 852 states, 851 states have (on average 1.0446533490011751) internal successors, (889), 851 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 889 transitions.
[2025-03-03 09:49:26,042 INFO  L78                 Accepts]: Start accepts. Automaton has 852 states and 889 transitions. Word has length 218
[2025-03-03 09:49:26,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:26,042 INFO  L471      AbstractCegarLoop]: Abstraction has 852 states and 889 transitions.
[2025-03-03 09:49:26,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 852 states and 889 transitions.
[2025-03-03 09:49:26,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-03 09:49:26,044 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:26,044 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:49:26,045 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:49:26,045 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:26,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:26,045 INFO  L85        PathProgramCache]: Analyzing trace with hash -343228784, now seen corresponding path program 1 times
[2025-03-03 09:49:26,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:26,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696670093]
[2025-03-03 09:49:26,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:26,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:26,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-03 09:49:26,066 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-03 09:49:26,067 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:26,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:26,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-03-03 09:49:26,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:26,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696670093]
[2025-03-03 09:49:26,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696670093] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:26,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:26,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:26,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508380387]
[2025-03-03 09:49:26,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:26,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:26,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:26,137 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:26,137 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:26,137 INFO  L87              Difference]: Start difference. First operand 852 states and 889 transitions. Second operand  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:26,379 INFO  L93              Difference]: Finished difference Result 1843 states and 1931 transitions.
[2025-03-03 09:49:26,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:26,379 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-03-03 09:49:26,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:26,381 INFO  L225             Difference]: With dead ends: 1843
[2025-03-03 09:49:26,381 INFO  L226             Difference]: Without dead ends: 990
[2025-03-03 09:49:26,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:26,383 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:26,383 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 171 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:49:26,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 990 states.
[2025-03-03 09:49:26,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990.
[2025-03-03 09:49:26,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 990 states, 989 states have (on average 1.0374115267947421) internal successors, (1026), 989 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1026 transitions.
[2025-03-03 09:49:26,395 INFO  L78                 Accepts]: Start accepts. Automaton has 990 states and 1026 transitions. Word has length 226
[2025-03-03 09:49:26,395 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:26,395 INFO  L471      AbstractCegarLoop]: Abstraction has 990 states and 1026 transitions.
[2025-03-03 09:49:26,395 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 990 states and 1026 transitions.
[2025-03-03 09:49:26,397 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-03-03 09:49:26,397 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:26,398 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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]
[2025-03-03 09:49:26,398 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 09:49:26,398 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:26,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:26,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -922307920, now seen corresponding path program 1 times
[2025-03-03 09:49:26,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:26,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883950245]
[2025-03-03 09:49:26,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:26,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:26,421 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-03-03 09:49:26,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-03-03 09:49:26,433 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:26,433 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:26,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked.
[2025-03-03 09:49:26,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:26,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883950245]
[2025-03-03 09:49:26,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883950245] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:26,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:26,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:26,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334221388]
[2025-03-03 09:49:26,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:26,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:26,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:26,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:26,522 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:26,523 INFO  L87              Difference]: Start difference. First operand 990 states and 1026 transitions. Second operand  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:26,654 INFO  L93              Difference]: Finished difference Result 1835 states and 1906 transitions.
[2025-03-03 09:49:26,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:26,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 235
[2025-03-03 09:49:26,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:26,655 INFO  L225             Difference]: With dead ends: 1835
[2025-03-03 09:49:26,655 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:49:26,656 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:26,657 INFO  L435           NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:26,657 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 10 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:49:26,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:49:26,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:49:26,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:49:26,657 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 235
[2025-03-03 09:49:26,657 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:26,657 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:49:26,657 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:26,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:49:26,658 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:49:26,660 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:49:26,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:49:26,662 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:26,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:49:26,850 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:49:26,866 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:26 BoogieIcfgContainer
[2025-03-03 09:49:26,867 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:49:26,868 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:49:26,868 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:49:26,868 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:49:26,869 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:49:19" (3/4) ...
[2025-03-03 09:49:26,870 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:49:26,885 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-03 09:49:26,888 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:49:26,889 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:49:26,889 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:49:26,983 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:49:26,983 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:49:26,983 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:49:26,985 INFO  L158              Benchmark]: Toolchain (without parser) took 8925.36ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 119.8MB in the beginning and 153.0MB in the end (delta: -33.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB.
[2025-03-03 09:49:26,985 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:26,985 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 340.53ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 94.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:49:26,985 INFO  L158              Benchmark]: Boogie Procedure Inliner took 64.21ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.9MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:26,986 INFO  L158              Benchmark]: Boogie Preprocessor took 72.60ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:26,986 INFO  L158              Benchmark]: IcfgBuilder took 860.96ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 90.3MB in the end (delta: -4.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
[2025-03-03 09:49:26,986 INFO  L158              Benchmark]: TraceAbstraction took 7466.31ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.4MB in the beginning and 163.9MB in the end (delta: -74.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:26,986 INFO  L158              Benchmark]: Witness Printer took 115.82ms. Allocated memory is still 243.3MB. Free memory was 163.9MB in the beginning and 153.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:26,987 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 118.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 340.53ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 94.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 64.21ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.9MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 72.60ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 860.96ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 90.3MB in the end (delta: -4.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7466.31ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.4MB in the beginning and 163.9MB in the end (delta: -74.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 115.82ms. Allocated memory is still 243.3MB. Free memory was 163.9MB in the beginning and 153.0MB in the end (delta: 11.0MB). 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: 476]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1797 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1797 mSDsluCounter, 1419 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 567 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4653 IncrementalHoareTripleChecker+Invalid, 5220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 567 mSolverCounterUnsat, 1231 mSDtfsCounter, 4653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2295occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 431 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2074 NumberOfCodeBlocks, 2074 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 5781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 925/941 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Location Invariant
    Derived location invariant: ((((((((((((a11 == 1) && (a28 == 10)) && (a17 <= 8)) && (a25 == 0)) || ((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a11 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || ((((a17 == 8) && (a28 <= 9)) && (a11 <= 0)) && (a25 == 0))) || (((a28 == 10) && (a17 <= 8)) && (a19 == 1))) || (((((a25 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7))) || (((((a25 == 1) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1)) && (a28 == 9))) || (((a28 <= 9) && (a11 == 1)) && (a17 <= 8))) || (((((a17 == 8) && (a25 == 1)) && (a28 <= 9)) && (a11 <= 0)) && (a19 == 1)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:49:27,004 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