./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 10:40:16,840 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 10:40:16,887 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 10:40:16,890 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 10:40:16,891 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 10:40:16,904 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 10:40:16,905 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 10:40:16,905 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 10:40:16,905 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 10:40:16,905 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 10:40:16,906 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 10:40:16,906 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 10:40:16,906 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 10:40:16,906 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 10:40:16,906 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 10:40:16,906 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 10:40:16,907 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 10:40:16,907 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 10:40:16,907 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 10:40:16,908 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 10:40:16,908 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 10:40:16,908 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 10:40:16,909 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 10:40:16,909 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 10:40:16,909 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 10:40:16,909 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 10:40:16,909 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 10:40:16,909 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-jdk21/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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685
[2025-02-05 10:40:17,215 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 10:40:17,221 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 10:40:17,222 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 10:40:17,223 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 10:40:17,223 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 10:40:17,224 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c
[2025-02-05 10:40:18,390 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d472096c/7115b2c1527e406985523639dfda7a3e/FLAGed3de876d
[2025-02-05 10:40:18,611 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 10:40:18,612 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c
[2025-02-05 10:40:18,624 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d472096c/7115b2c1527e406985523639dfda7a3e/FLAGed3de876d
[2025-02-05 10:40:18,951 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d472096c/7115b2c1527e406985523639dfda7a3e
[2025-02-05 10:40:18,953 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 10:40:18,955 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 10:40:18,956 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 10:40:18,956 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 10:40:18,959 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 10:40:18,959 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:18" (1/1) ...
[2025-02-05 10:40:18,961 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:18, skipping insertion in model container
[2025-02-05 10:40:18,961 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:18" (1/1) ...
[2025-02-05 10:40:18,971 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 10:40:19,082 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c[2207,2220]
[2025-02-05 10:40:19,087 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:40:19,095 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 10:40:19,109 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c[2207,2220]
[2025-02-05 10:40:19,112 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:40:19,121 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 10:40:19,122 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19 WrapperNode
[2025-02-05 10:40:19,122 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 10:40:19,124 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 10:40:19,124 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 10:40:19,124 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 10:40:19,130 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,135 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,147 INFO  L138                Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85
[2025-02-05 10:40:19,147 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 10:40:19,148 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 10:40:19,148 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 10:40:19,148 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 10:40:19,152 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,153 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,158 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,166 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-02-05 10:40:19,167 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,167 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,171 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,175 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,175 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,176 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,177 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 10:40:19,177 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 10:40:19,177 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 10:40:19,180 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 10:40:19,181 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (1/1) ...
[2025-02-05 10:40:19,185 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 10:40:19,193 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:40:19,207 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 10:40:19,209 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 10:40:19,235 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 10:40:19,235 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 10:40:19,235 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 10:40:19,235 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 10:40:19,270 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 10:40:19,271 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 10:40:19,398 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-05 10:40:19,399 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 10:40:19,405 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 10:40:19,405 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 10:40:19,405 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:19 BoogieIcfgContainer
[2025-02-05 10:40:19,405 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 10:40:19,407 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 10:40:19,407 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 10:40:19,411 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 10:40:19,411 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:18" (1/3) ...
[2025-02-05 10:40:19,411 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1724da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:19, skipping insertion in model container
[2025-02-05 10:40:19,412 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:19" (2/3) ...
[2025-02-05 10:40:19,412 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1724da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:19, skipping insertion in model container
[2025-02-05 10:40:19,412 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:19" (3/3) ...
[2025-02-05 10:40:19,413 INFO  L128   eAbstractionObserver]: Analyzing ICFG test_locks_5.c
[2025-02-05 10:40:19,424 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 10:40:19,426 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_5.c that has 1 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 10:40:19,456 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 10:40:19,464 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;@25a6266b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 10:40:19,464 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 10:40:19,466 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-05 10:40:19,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-02-05 10:40:19,469 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:19,470 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:19,470 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:19,473 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:19,473 INFO  L85        PathProgramCache]: Analyzing trace with hash -678875495, now seen corresponding path program 1 times
[2025-02-05 10:40:19,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:19,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044519108]
[2025-02-05 10:40:19,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:19,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:19,531 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-05 10:40:19,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-05 10:40:19,548 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:19,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:19,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:19,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:19,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044519108]
[2025-02-05 10:40:19,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044519108] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:19,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:19,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:19,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80109262]
[2025-02-05 10:40:19,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:19,639 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:19,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:19,652 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:19,652 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:19,654 INFO  L87              Difference]: Start difference. First operand  has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-05 10:40:19,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:19,688 INFO  L93              Difference]: Finished difference Result 51 states and 82 transitions.
[2025-02-05 10:40:19,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:19,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12
[2025-02-05 10:40:19,690 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:19,694 INFO  L225             Difference]: With dead ends: 51
[2025-02-05 10:40:19,694 INFO  L226             Difference]: Without dead ends: 39
[2025-02-05 10:40:19,696 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-02-05 10:40:19,699 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:19,699 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:19,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-02-05 10:40:19,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27.
[2025-02-05 10:40:19,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 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-02-05 10:40:19,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions.
[2025-02-05 10:40:19,723 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 12
[2025-02-05 10:40:19,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:19,723 INFO  L471      AbstractCegarLoop]: Abstraction has 27 states and 46 transitions.
[2025-02-05 10:40:19,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-05 10:40:19,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions.
[2025-02-05 10:40:19,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-02-05 10:40:19,725 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:19,725 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:19,726 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 10:40:19,726 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:19,726 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:19,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 1063934840, now seen corresponding path program 1 times
[2025-02-05 10:40:19,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:19,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272643336]
[2025-02-05 10:40:19,727 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:19,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:19,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-05 10:40:19,746 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-05 10:40:19,748 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:19,748 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:19,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:19,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:19,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272643336]
[2025-02-05 10:40:19,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272643336] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:19,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:19,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:19,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649822916]
[2025-02-05 10:40:19,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:19,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:19,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:19,786 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:19,786 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:19,786 INFO  L87              Difference]: Start difference. First operand 27 states and 46 transitions. Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-05 10:40:19,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:19,803 INFO  L93              Difference]: Finished difference Result 64 states and 109 transitions.
[2025-02-05 10:40:19,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:19,804 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12
[2025-02-05 10:40:19,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:19,805 INFO  L225             Difference]: With dead ends: 64
[2025-02-05 10:40:19,805 INFO  L226             Difference]: Without dead ends: 39
[2025-02-05 10:40:19,805 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-02-05 10:40:19,806 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:19,806 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:19,806 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-02-05 10:40:19,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37.
[2025-02-05 10:40:19,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 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-02-05 10:40:19,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions.
[2025-02-05 10:40:19,813 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 12
[2025-02-05 10:40:19,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:19,813 INFO  L471      AbstractCegarLoop]: Abstraction has 37 states and 62 transitions.
[2025-02-05 10:40:19,814 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-05 10:40:19,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions.
[2025-02-05 10:40:19,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-02-05 10:40:19,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:19,815 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:19,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 10:40:19,815 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:19,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:19,816 INFO  L85        PathProgramCache]: Analyzing trace with hash 429722891, now seen corresponding path program 1 times
[2025-02-05 10:40:19,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:19,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286349968]
[2025-02-05 10:40:19,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:19,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:19,824 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-05 10:40:19,831 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-05 10:40:19,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:19,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:19,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:19,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:19,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286349968]
[2025-02-05 10:40:19,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286349968] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:19,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:19,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:19,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853518776]
[2025-02-05 10:40:19,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:19,864 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:19,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:19,864 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:19,864 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:19,864 INFO  L87              Difference]: Start difference. First operand 37 states and 62 transitions. Second operand  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:19,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:19,881 INFO  L93              Difference]: Finished difference Result 60 states and 96 transitions.
[2025-02-05 10:40:19,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:19,881 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13
[2025-02-05 10:40:19,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:19,883 INFO  L225             Difference]: With dead ends: 60
[2025-02-05 10:40:19,883 INFO  L226             Difference]: Without dead ends: 42
[2025-02-05 10:40:19,883 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-02-05 10:40:19,884 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:19,884 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:19,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-02-05 10:40:19,888 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40.
[2025-02-05 10:40:19,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-05 10:40:19,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions.
[2025-02-05 10:40:19,891 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 13
[2025-02-05 10:40:19,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:19,893 INFO  L471      AbstractCegarLoop]: Abstraction has 40 states and 64 transitions.
[2025-02-05 10:40:19,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:19,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions.
[2025-02-05 10:40:19,893 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-02-05 10:40:19,894 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:19,894 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:19,894 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 10:40:19,894 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:19,894 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:19,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -1377731572, now seen corresponding path program 1 times
[2025-02-05 10:40:19,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:19,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145980475]
[2025-02-05 10:40:19,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:19,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:19,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-05 10:40:19,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-05 10:40:19,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:19,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:19,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:19,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:19,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145980475]
[2025-02-05 10:40:19,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145980475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:19,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:19,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:19,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279764809]
[2025-02-05 10:40:19,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:19,941 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:19,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:19,941 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:19,941 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:19,942 INFO  L87              Difference]: Start difference. First operand 40 states and 64 transitions. Second operand  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:19,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:19,956 INFO  L93              Difference]: Finished difference Result 108 states and 176 transitions.
[2025-02-05 10:40:19,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:19,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13
[2025-02-05 10:40:19,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:19,958 INFO  L225             Difference]: With dead ends: 108
[2025-02-05 10:40:19,958 INFO  L226             Difference]: Without dead ends: 73
[2025-02-05 10:40:19,958 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-02-05 10:40:19,958 INFO  L435           NwaCegarLoop]: 38 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:19,959 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:19,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2025-02-05 10:40:19,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71.
[2025-02-05 10:40:19,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 70 states have (on average 1.6142857142857143) internal successors, (113), 70 states have internal predecessors, (113), 0 states have call successors, (0), 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-02-05 10:40:19,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions.
[2025-02-05 10:40:19,970 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 113 transitions. Word has length 13
[2025-02-05 10:40:19,971 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:19,971 INFO  L471      AbstractCegarLoop]: Abstraction has 71 states and 113 transitions.
[2025-02-05 10:40:19,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:19,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 113 transitions.
[2025-02-05 10:40:19,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-02-05 10:40:19,971 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:19,971 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:19,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 10:40:19,971 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:19,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:19,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174425389, now seen corresponding path program 1 times
[2025-02-05 10:40:19,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:19,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304151553]
[2025-02-05 10:40:19,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:19,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:19,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-05 10:40:19,988 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-05 10:40:19,988 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:19,988 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304151553]
[2025-02-05 10:40:20,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304151553] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792309626]
[2025-02-05 10:40:20,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,013 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,018 INFO  L87              Difference]: Start difference. First operand 71 states and 113 transitions. Second operand  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:20,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,031 INFO  L93              Difference]: Finished difference Result 91 states and 143 transitions.
[2025-02-05 10:40:20,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13
[2025-02-05 10:40:20,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,032 INFO  L225             Difference]: With dead ends: 91
[2025-02-05 10:40:20,032 INFO  L226             Difference]: Without dead ends: 89
[2025-02-05 10:40:20,032 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-02-05 10:40:20,033 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,033 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-02-05 10:40:20,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71.
[2025-02-05 10:40:20,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 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-02-05 10:40:20,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions.
[2025-02-05 10:40:20,037 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 13
[2025-02-05 10:40:20,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,038 INFO  L471      AbstractCegarLoop]: Abstraction has 71 states and 111 transitions.
[2025-02-05 10:40:20,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-05 10:40:20,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions.
[2025-02-05 10:40:20,038 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2025-02-05 10:40:20,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,038 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,038 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 10:40:20,038 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 240020767, now seen corresponding path program 1 times
[2025-02-05 10:40:20,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014377605]
[2025-02-05 10:40:20,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes.
[2025-02-05 10:40:20,044 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements.
[2025-02-05 10:40:20,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014377605]
[2025-02-05 10:40:20,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014377605] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911274925]
[2025-02-05 10:40:20,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,057 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,057 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,057 INFO  L87              Difference]: Start difference. First operand 71 states and 111 transitions. Second operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-02-05 10:40:20,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,067 INFO  L93              Difference]: Finished difference Result 127 states and 199 transitions.
[2025-02-05 10:40:20,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,068 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14
[2025-02-05 10:40:20,068 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,068 INFO  L225             Difference]: With dead ends: 127
[2025-02-05 10:40:20,068 INFO  L226             Difference]: Without dead ends: 125
[2025-02-05 10:40:20,069 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-02-05 10:40:20,069 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,069 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2025-02-05 10:40:20,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99.
[2025-02-05 10:40:20,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 98 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:40:20,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions.
[2025-02-05 10:40:20,083 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 14
[2025-02-05 10:40:20,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,083 INFO  L471      AbstractCegarLoop]: Abstraction has 99 states and 153 transitions.
[2025-02-05 10:40:20,083 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-02-05 10:40:20,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions.
[2025-02-05 10:40:20,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2025-02-05 10:40:20,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,084 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,084 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 10:40:20,084 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,084 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,084 INFO  L85        PathProgramCache]: Analyzing trace with hash 1982831102, now seen corresponding path program 1 times
[2025-02-05 10:40:20,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044039422]
[2025-02-05 10:40:20,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,092 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes.
[2025-02-05 10:40:20,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements.
[2025-02-05 10:40:20,097 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,097 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044039422]
[2025-02-05 10:40:20,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044039422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578033855]
[2025-02-05 10:40:20,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,123 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,123 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,123 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,123 INFO  L87              Difference]: Start difference. First operand 99 states and 153 transitions. Second operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-02-05 10:40:20,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,145 INFO  L93              Difference]: Finished difference Result 227 states and 351 transitions.
[2025-02-05 10:40:20,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14
[2025-02-05 10:40:20,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,146 INFO  L225             Difference]: With dead ends: 227
[2025-02-05 10:40:20,147 INFO  L226             Difference]: Without dead ends: 133
[2025-02-05 10:40:20,151 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-02-05 10:40:20,151 INFO  L435           NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,151 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-02-05 10:40:20,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131.
[2025-02-05 10:40:20,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 131 states, 130 states have (on average 1.5) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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-02-05 10:40:20,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions.
[2025-02-05 10:40:20,162 INFO  L78                 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 14
[2025-02-05 10:40:20,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,162 INFO  L471      AbstractCegarLoop]: Abstraction has 131 states and 195 transitions.
[2025-02-05 10:40:20,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-02-05 10:40:20,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions.
[2025-02-05 10:40:20,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-02-05 10:40:20,166 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,166 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 10:40:20,167 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -1149264493, now seen corresponding path program 1 times
[2025-02-05 10:40:20,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975776264]
[2025-02-05 10:40:20,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-02-05 10:40:20,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-02-05 10:40:20,176 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,176 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975776264]
[2025-02-05 10:40:20,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975776264] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309220241]
[2025-02-05 10:40:20,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,190 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,190 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,191 INFO  L87              Difference]: Start difference. First operand 131 states and 195 transitions. Second operand  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,200 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,200 INFO  L93              Difference]: Finished difference Result 201 states and 297 transitions.
[2025-02-05 10:40:20,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,200 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15
[2025-02-05 10:40:20,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,201 INFO  L225             Difference]: With dead ends: 201
[2025-02-05 10:40:20,201 INFO  L226             Difference]: Without dead ends: 139
[2025-02-05 10:40:20,201 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-02-05 10:40:20,202 INFO  L435           NwaCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,202 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 72 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-02-05 10:40:20,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137.
[2025-02-05 10:40:20,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 0 states have call successors, (0), 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-02-05 10:40:20,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions.
[2025-02-05 10:40:20,207 INFO  L78                 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 15
[2025-02-05 10:40:20,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,207 INFO  L471      AbstractCegarLoop]: Abstraction has 137 states and 199 transitions.
[2025-02-05 10:40:20,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions.
[2025-02-05 10:40:20,208 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-02-05 10:40:20,208 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,208 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,208 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 10:40:20,209 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 1338248340, now seen corresponding path program 1 times
[2025-02-05 10:40:20,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542782854]
[2025-02-05 10:40:20,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-02-05 10:40:20,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-02-05 10:40:20,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542782854]
[2025-02-05 10:40:20,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542782854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970335434]
[2025-02-05 10:40:20,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,225 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,225 INFO  L87              Difference]: Start difference. First operand 137 states and 199 transitions. Second operand  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,236 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,237 INFO  L93              Difference]: Finished difference Result 233 states and 337 transitions.
[2025-02-05 10:40:20,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,237 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15
[2025-02-05 10:40:20,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,238 INFO  L225             Difference]: With dead ends: 233
[2025-02-05 10:40:20,238 INFO  L226             Difference]: Without dead ends: 231
[2025-02-05 10:40:20,238 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-02-05 10:40:20,239 INFO  L435           NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,239 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2025-02-05 10:40:20,248 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 197.
[2025-02-05 10:40:20,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-05 10:40:20,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions.
[2025-02-05 10:40:20,249 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 15
[2025-02-05 10:40:20,249 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,249 INFO  L471      AbstractCegarLoop]: Abstraction has 197 states and 279 transitions.
[2025-02-05 10:40:20,249 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions.
[2025-02-05 10:40:20,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-02-05 10:40:20,250 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,250 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,250 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 10:40:20,251 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,251 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -1213908621, now seen corresponding path program 1 times
[2025-02-05 10:40:20,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880528387]
[2025-02-05 10:40:20,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-02-05 10:40:20,256 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-02-05 10:40:20,256 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880528387]
[2025-02-05 10:40:20,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880528387] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608312103]
[2025-02-05 10:40:20,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,275 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,276 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,276 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,276 INFO  L87              Difference]: Start difference. First operand 197 states and 279 transitions. Second operand  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,295 INFO  L93              Difference]: Finished difference Result 441 states and 617 transitions.
[2025-02-05 10:40:20,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15
[2025-02-05 10:40:20,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,297 INFO  L225             Difference]: With dead ends: 441
[2025-02-05 10:40:20,297 INFO  L226             Difference]: Without dead ends: 255
[2025-02-05 10:40:20,297 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-02-05 10:40:20,298 INFO  L435           NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-02-05 10:40:20,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253.
[2025-02-05 10:40:20,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 253 states, 252 states have (on average 1.3452380952380953) internal successors, (339), 252 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-05 10:40:20,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 339 transitions.
[2025-02-05 10:40:20,308 INFO  L78                 Accepts]: Start accepts. Automaton has 253 states and 339 transitions. Word has length 15
[2025-02-05 10:40:20,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,308 INFO  L471      AbstractCegarLoop]: Abstraction has 253 states and 339 transitions.
[2025-02-05 10:40:20,308 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-05 10:40:20,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 253 states and 339 transitions.
[2025-02-05 10:40:20,309 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-02-05 10:40:20,309 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,309 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,309 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 10:40:20,309 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,310 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,310 INFO  L85        PathProgramCache]: Analyzing trace with hash -1463948315, now seen corresponding path program 1 times
[2025-02-05 10:40:20,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770792853]
[2025-02-05 10:40:20,310 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-05 10:40:20,317 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-05 10:40:20,317 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770792853]
[2025-02-05 10:40:20,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770792853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722273965]
[2025-02-05 10:40:20,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,332 INFO  L87              Difference]: Start difference. First operand 253 states and 339 transitions. Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,356 INFO  L93              Difference]: Finished difference Result 381 states and 505 transitions.
[2025-02-05 10:40:20,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2025-02-05 10:40:20,358 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,359 INFO  L225             Difference]: With dead ends: 381
[2025-02-05 10:40:20,359 INFO  L226             Difference]: Without dead ends: 263
[2025-02-05 10:40:20,360 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-02-05 10:40:20,360 INFO  L435           NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2025-02-05 10:40:20,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261.
[2025-02-05 10:40:20,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-05 10:40:20,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions.
[2025-02-05 10:40:20,394 INFO  L78                 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 16
[2025-02-05 10:40:20,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,394 INFO  L471      AbstractCegarLoop]: Abstraction has 261 states and 339 transitions.
[2025-02-05 10:40:20,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions.
[2025-02-05 10:40:20,395 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-02-05 10:40:20,395 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,395 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 10:40:20,395 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,395 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,395 INFO  L85        PathProgramCache]: Analyzing trace with hash 1023564518, now seen corresponding path program 1 times
[2025-02-05 10:40:20,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806025963]
[2025-02-05 10:40:20,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-05 10:40:20,408 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-05 10:40:20,408 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,408 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806025963]
[2025-02-05 10:40:20,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806025963] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18578326]
[2025-02-05 10:40:20,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,425 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,429 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,429 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,429 INFO  L87              Difference]: Start difference. First operand 261 states and 339 transitions. Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,455 INFO  L93              Difference]: Finished difference Result 423 states and 540 transitions.
[2025-02-05 10:40:20,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2025-02-05 10:40:20,456 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,457 INFO  L225             Difference]: With dead ends: 423
[2025-02-05 10:40:20,457 INFO  L226             Difference]: Without dead ends: 421
[2025-02-05 10:40:20,457 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-02-05 10:40:20,458 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,458 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2025-02-05 10:40:20,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 389.
[2025-02-05 10:40:20,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 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-02-05 10:40:20,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 491 transitions.
[2025-02-05 10:40:20,476 INFO  L78                 Accepts]: Start accepts. Automaton has 389 states and 491 transitions. Word has length 16
[2025-02-05 10:40:20,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,476 INFO  L471      AbstractCegarLoop]: Abstraction has 389 states and 491 transitions.
[2025-02-05 10:40:20,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 389 states and 491 transitions.
[2025-02-05 10:40:20,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-02-05 10:40:20,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:40:20,477 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,477 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 10:40:20,477 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:40:20,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:40:20,478 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528592443, now seen corresponding path program 1 times
[2025-02-05 10:40:20,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:40:20,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722211326]
[2025-02-05 10:40:20,478 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:40:20,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:40:20,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-02-05 10:40:20,482 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-02-05 10:40:20,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:40:20,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:40:20,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:40:20,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:40:20,502 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722211326]
[2025-02-05 10:40:20,502 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722211326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:40:20,502 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:40:20,502 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:40:20,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523351400]
[2025-02-05 10:40:20,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:40:20,502 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:40:20,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:40:20,502 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:40:20,503 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:40:20,503 INFO  L87              Difference]: Start difference. First operand 389 states and 491 transitions. Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,525 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:40:20,525 INFO  L93              Difference]: Finished difference Result 853 states and 1051 transitions.
[2025-02-05 10:40:20,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:40:20,526 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2025-02-05 10:40:20,526 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:40:20,526 INFO  L225             Difference]: With dead ends: 853
[2025-02-05 10:40:20,526 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 10:40:20,527 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-02-05 10:40:20,528 INFO  L435           NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 10:40:20,529 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 10:40:20,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 10:40:20,529 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 10:40:20,529 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-02-05 10:40:20,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 10:40:20,530 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16
[2025-02-05 10:40:20,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:40:20,530 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 10:40:20,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-05 10:40:20,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 10:40:20,530 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 10:40:20,532 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 10:40:20,533 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 10:40:20,536 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:40:20,538 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 10:40:20,544 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 10:40:20,553 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:40:20 BoogieIcfgContainer
[2025-02-05 10:40:20,553 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 10:40:20,554 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 10:40:20,554 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 10:40:20,554 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 10:40:20,555 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:19" (3/4) ...
[2025-02-05 10:40:20,556 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 10:40:20,562 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges
[2025-02-05 10:40:20,562 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 10:40:20,562 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 10:40:20,563 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 10:40:20,613 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 10:40:20,614 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 10:40:20,614 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 10:40:20,614 INFO  L158              Benchmark]: Toolchain (without parser) took 1659.73ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 121.6MB in the end (delta: 36.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB.
[2025-02-05 10:40:20,615 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 209.7MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 10:40:20,616 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 166.85ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 146.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 10:40:20,617 INFO  L158              Benchmark]: Boogie Procedure Inliner took 23.75ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 145.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 10:40:20,617 INFO  L158              Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 974.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 10:40:20,617 INFO  L158              Benchmark]: IcfgBuilder took 228.39ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 10:40:20,618 INFO  L158              Benchmark]: TraceAbstraction took 1146.09ms. Allocated memory is still 201.3MB. Free memory was 131.7MB in the beginning and 128.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB.
[2025-02-05 10:40:20,618 INFO  L158              Benchmark]: Witness Printer took 60.26ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 121.6MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 10:40:20,619 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.22ms. Allocated memory is still 209.7MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 166.85ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 146.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 23.75ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 145.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 29.01ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 974.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 228.39ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 1146.09ms. Allocated memory is still 201.3MB. Free memory was 131.7MB in the beginning and 128.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB.
 * Witness Printer took 60.26ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 121.6MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 93]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 930 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 574 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=12, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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
RESULT: Ultimate proved your program to be correct!
[2025-02-05 10:40:20,635 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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