./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label44.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/eca-rers2012/Problem11_label44.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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:33:33,722 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:33:33,763 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:33:33,768 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:33:33,768 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:33:33,784 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:33:33,785 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:33:33,785 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:33:33,785 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:33:33,785 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:33:33,785 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:33:33,785 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:33:33,786 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:33:33,786 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:33:33,786 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:33:33,787 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:33:33,787 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:33:33,787 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:33:33,787 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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b
[2025-02-05 11:33:33,959 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:33:33,965 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:33:33,966 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:33:33,967 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:33:33,967 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:33:33,968 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label44.c
[2025-02-05 11:33:35,168 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1e36dbac/9592014caf054638a04c9b09f9274755/FLAGf546561f5
[2025-02-05 11:33:35,530 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:33:35,531 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c
[2025-02-05 11:33:35,549 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1e36dbac/9592014caf054638a04c9b09f9274755/FLAGf546561f5
[2025-02-05 11:33:35,567 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1e36dbac/9592014caf054638a04c9b09f9274755
[2025-02-05 11:33:35,569 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:33:35,571 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:33:35,573 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:33:35,574 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:33:35,578 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:33:35,578 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:35" (1/1) ...
[2025-02-05 11:33:35,579 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66899fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:35, skipping insertion in model container
[2025-02-05 11:33:35,579 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:35" (1/1) ...
[2025-02-05 11:33:35,615 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:33:35,767 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/eca-rers2012/Problem11_label44.c[3841,3854]
[2025-02-05 11:33:35,967 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:33:35,989 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:33:36,022 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/eca-rers2012/Problem11_label44.c[3841,3854]
[2025-02-05 11:33:36,177 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:33:36,206 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:33:36,210 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36 WrapperNode
[2025-02-05 11:33:36,211 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:33:36,212 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:33:36,212 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:33:36,212 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:33:36,220 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,262 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,411 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997
[2025-02-05 11:33:36,411 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:33:36,412 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:33:36,412 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:33:36,413 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:33:36,427 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,427 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,449 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,518 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 11:33:36,521 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,522 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,577 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,590 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,603 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,612 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,633 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:33:36,638 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:33:36,638 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:33:36,638 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:33:36,639 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (1/1) ...
[2025-02-05 11:33:36,648 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:33:36,664 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:33:36,690 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 11:33:36,739 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 11:33:36,776 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:33:36,776 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:33:36,776 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:33:36,776 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:33:36,834 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:33:36,836 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:33:38,205 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2025-02-05 11:33:38,206 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:33:38,222 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:33:38,222 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:33:38,223 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:38 BoogieIcfgContainer
[2025-02-05 11:33:38,224 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:33:38,226 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:33:38,226 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:33:38,229 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:33:38,230 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:35" (1/3) ...
[2025-02-05 11:33:38,230 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f2648e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:38, skipping insertion in model container
[2025-02-05 11:33:38,230 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:36" (2/3) ...
[2025-02-05 11:33:38,231 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f2648e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:38, skipping insertion in model container
[2025-02-05 11:33:38,231 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:38" (3/3) ...
[2025-02-05 11:33:38,232 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem11_label44.c
[2025-02-05 11:33:38,243 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:33:38,245 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label44.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:33:38,294 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:33:38,305 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;@17213cdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:33:38,305 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:33:38,309 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 11:33:38,314 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-02-05 11:33:38,315 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:38,315 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:38,316 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:38,319 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:38,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1455960224, now seen corresponding path program 1 times
[2025-02-05 11:33:38,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:38,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93982473]
[2025-02-05 11:33:38,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:38,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:38,378 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-02-05 11:33:38,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-02-05 11:33:38,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:38,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:38,499 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 11:33:38,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:38,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93982473]
[2025-02-05 11:33:38,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93982473] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:38,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:38,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:38,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720723002]
[2025-02-05 11:33:38,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:38,504 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:38,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:38,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:38,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:38,519 INFO  L87              Difference]: Start difference. First operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 11:33:39,339 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:39,340 INFO  L93              Difference]: Finished difference Result 761 states and 1342 transitions.
[2025-02-05 11:33:39,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:39,342 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26
[2025-02-05 11:33:39,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:39,349 INFO  L225             Difference]: With dead ends: 761
[2025-02-05 11:33:39,349 INFO  L226             Difference]: Without dead ends: 413
[2025-02-05 11:33:39,351 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:39,353 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 202 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:39,353 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:39,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2025-02-05 11:33:39,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413.
[2025-02-05 11:33:39,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 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 11:33:39,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions.
[2025-02-05 11:33:39,393 INFO  L78                 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 26
[2025-02-05 11:33:39,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:39,393 INFO  L471      AbstractCegarLoop]: Abstraction has 413 states and 599 transitions.
[2025-02-05 11:33:39,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 11:33:39,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions.
[2025-02-05 11:33:39,395 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-05 11:33:39,395 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:39,396 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:39,396 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:33:39,396 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:39,396 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:39,396 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132705045, now seen corresponding path program 1 times
[2025-02-05 11:33:39,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:39,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770629758]
[2025-02-05 11:33:39,397 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:39,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:39,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-05 11:33:39,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-05 11:33:39,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:39,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:39,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:39,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:39,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770629758]
[2025-02-05 11:33:39,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770629758] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:39,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:39,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:39,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905815927]
[2025-02-05 11:33:39,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:39,626 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:39,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:39,627 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:39,627 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:39,630 INFO  L87              Difference]: Start difference. First operand 413 states and 599 transitions. Second operand  has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 11:33:40,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:40,338 INFO  L93              Difference]: Finished difference Result 1211 states and 1763 transitions.
[2025-02-05 11:33:40,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:40,338 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94
[2025-02-05 11:33:40,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:40,343 INFO  L225             Difference]: With dead ends: 1211
[2025-02-05 11:33:40,343 INFO  L226             Difference]: Without dead ends: 800
[2025-02-05 11:33:40,350 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:40,350 INFO  L435           NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:40,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:33:40,351 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2025-02-05 11:33:40,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789.
[2025-02-05 11:33:40,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 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 11:33:40,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions.
[2025-02-05 11:33:40,426 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 94
[2025-02-05 11:33:40,426 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:40,426 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions.
[2025-02-05 11:33:40,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 11:33:40,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions.
[2025-02-05 11:33:40,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-05 11:33:40,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:40,431 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:40,431 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:33:40,431 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:40,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:40,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -958794291, now seen corresponding path program 1 times
[2025-02-05 11:33:40,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:40,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952647836]
[2025-02-05 11:33:40,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:40,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:40,460 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-05 11:33:40,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-05 11:33:40,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:40,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:40,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:40,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:40,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952647836]
[2025-02-05 11:33:40,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952647836] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:40,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:40,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:40,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210375571]
[2025-02-05 11:33:40,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:40,883 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:33:40,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:40,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:33:40,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:33:40,883 INFO  L87              Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 11:33:42,488 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:42,488 INFO  L93              Difference]: Finished difference Result 2505 states and 3428 transitions.
[2025-02-05 11:33:42,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:33:42,489 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2025-02-05 11:33:42,489 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:42,497 INFO  L225             Difference]: With dead ends: 2505
[2025-02-05 11:33:42,500 INFO  L226             Difference]: Without dead ends: 1718
[2025-02-05 11:33:42,501 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:33:42,502 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:42,502 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 11:33:42,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2025-02-05 11:33:42,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714.
[2025-02-05 11:33:42,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 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 11:33:42,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions.
[2025-02-05 11:33:42,558 INFO  L78                 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 95
[2025-02-05 11:33:42,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:42,562 INFO  L471      AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions.
[2025-02-05 11:33:42,562 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 11:33:42,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions.
[2025-02-05 11:33:42,563 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-02-05 11:33:42,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:42,567 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:42,567 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:33:42,567 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:42,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:42,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 1136476867, now seen corresponding path program 1 times
[2025-02-05 11:33:42,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:42,567 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956408530]
[2025-02-05 11:33:42,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:42,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:42,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-02-05 11:33:42,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-02-05 11:33:42,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:42,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:42,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:42,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:42,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956408530]
[2025-02-05 11:33:42,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956408530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:42,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:42,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:42,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208409456]
[2025-02-05 11:33:42,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:42,878 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:42,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:42,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:42,879 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:42,879 INFO  L87              Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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 11:33:44,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:44,186 INFO  L93              Difference]: Finished difference Result 4005 states and 5048 transitions.
[2025-02-05 11:33:44,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:44,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153
[2025-02-05 11:33:44,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:44,202 INFO  L225             Difference]: With dead ends: 4005
[2025-02-05 11:33:44,202 INFO  L226             Difference]: Without dead ends: 2477
[2025-02-05 11:33:44,204 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 11:33:44,208 INFO  L435           NwaCegarLoop]: 290 mSDtfsCounter, 209 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:44,208 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 11:33:44,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2477 states.
[2025-02-05 11:33:44,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474.
[2025-02-05 11:33:44,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2474 states, 2473 states have (on average 1.2308936514355033) internal successors, (3044), 2473 states have internal predecessors, (3044), 0 states have call successors, (0), 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 11:33:44,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions.
[2025-02-05 11:33:44,297 INFO  L78                 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 153
[2025-02-05 11:33:44,297 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:44,297 INFO  L471      AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions.
[2025-02-05 11:33:44,297 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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 11:33:44,298 INFO  L276                IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions.
[2025-02-05 11:33:44,299 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 11:33:44,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:44,302 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:44,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:33:44,302 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:44,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:44,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 96098514, now seen corresponding path program 1 times
[2025-02-05 11:33:44,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:44,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280399199]
[2025-02-05 11:33:44,303 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:44,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:44,330 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 11:33:44,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 11:33:44,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:44,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:44,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:44,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:44,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280399199]
[2025-02-05 11:33:44,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280399199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:44,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:44,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:44,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951257794]
[2025-02-05 11:33:44,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:44,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:44,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:44,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:44,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:44,628 INFO  L87              Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand  has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 11:33:45,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:45,379 INFO  L93              Difference]: Finished difference Result 5885 states and 7350 transitions.
[2025-02-05 11:33:45,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:45,379 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206
[2025-02-05 11:33:45,380 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:45,393 INFO  L225             Difference]: With dead ends: 5885
[2025-02-05 11:33:45,393 INFO  L226             Difference]: Without dead ends: 3597
[2025-02-05 11:33:45,395 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 11:33:45,396 INFO  L435           NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:45,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:33:45,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3597 states.
[2025-02-05 11:33:45,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397.
[2025-02-05 11:33:45,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3397 states, 3396 states have (on average 1.2105418138987043) internal successors, (4111), 3396 states have internal predecessors, (4111), 0 states have call successors, (0), 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 11:33:45,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions.
[2025-02-05 11:33:45,446 INFO  L78                 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 206
[2025-02-05 11:33:45,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:45,447 INFO  L471      AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions.
[2025-02-05 11:33:45,447 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 11:33:45,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions.
[2025-02-05 11:33:45,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-02-05 11:33:45,450 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:45,450 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:45,450 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:33:45,450 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:45,451 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:45,451 INFO  L85        PathProgramCache]: Analyzing trace with hash 1266141616, now seen corresponding path program 1 times
[2025-02-05 11:33:45,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:45,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819902760]
[2025-02-05 11:33:45,451 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:45,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:45,474 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-02-05 11:33:45,495 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-02-05 11:33:45,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:45,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:45,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-02-05 11:33:45,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:45,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819902760]
[2025-02-05 11:33:45,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819902760] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:45,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:45,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:45,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757571739]
[2025-02-05 11:33:45,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:45,822 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:45,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:45,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:45,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:45,823 INFO  L87              Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:46,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:46,689 INFO  L93              Difference]: Finished difference Result 9030 states and 11023 transitions.
[2025-02-05 11:33:46,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:46,690 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 207
[2025-02-05 11:33:46,691 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:46,706 INFO  L225             Difference]: With dead ends: 9030
[2025-02-05 11:33:46,706 INFO  L226             Difference]: Without dead ends: 5635
[2025-02-05 11:33:46,710 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 11:33:46,711 INFO  L435           NwaCegarLoop]: 322 mSDtfsCounter, 195 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:46,713 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 347 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:46,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5635 states.
[2025-02-05 11:33:46,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635.
[2025-02-05 11:33:46,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5635 states, 5634 states have (on average 1.207667731629393) internal successors, (6804), 5634 states have internal predecessors, (6804), 0 states have call successors, (0), 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 11:33:46,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 6804 transitions.
[2025-02-05 11:33:46,796 INFO  L78                 Accepts]: Start accepts. Automaton has 5635 states and 6804 transitions. Word has length 207
[2025-02-05 11:33:46,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:46,796 INFO  L471      AbstractCegarLoop]: Abstraction has 5635 states and 6804 transitions.
[2025-02-05 11:33:46,796 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:46,796 INFO  L276                IsEmpty]: Start isEmpty. Operand 5635 states and 6804 transitions.
[2025-02-05 11:33:46,798 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-05 11:33:46,798 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:46,798 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:46,798 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:33:46,798 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:46,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:46,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 354936973, now seen corresponding path program 1 times
[2025-02-05 11:33:46,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:46,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352105291]
[2025-02-05 11:33:46,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:46,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:46,819 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 11:33:46,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 11:33:46,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:46,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:46,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-02-05 11:33:46,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:46,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352105291]
[2025-02-05 11:33:46,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352105291] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:46,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:46,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:46,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036320559]
[2025-02-05 11:33:46,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:46,966 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:46,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:46,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:46,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:46,967 INFO  L87              Difference]: Start difference. First operand 5635 states and 6804 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:47,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:47,902 INFO  L93              Difference]: Finished difference Result 12389 states and 15113 transitions.
[2025-02-05 11:33:47,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:47,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 208
[2025-02-05 11:33:47,903 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:47,920 INFO  L225             Difference]: With dead ends: 12389
[2025-02-05 11:33:47,920 INFO  L226             Difference]: Without dead ends: 6756
[2025-02-05 11:33:47,925 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 11:33:47,925 INFO  L435           NwaCegarLoop]: 365 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:47,925 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 386 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:33:47,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6756 states.
[2025-02-05 11:33:47,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6739.
[2025-02-05 11:33:48,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6739 states, 6738 states have (on average 1.1852181656277827) internal successors, (7986), 6738 states have internal predecessors, (7986), 0 states have call successors, (0), 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 11:33:48,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 7986 transitions.
[2025-02-05 11:33:48,016 INFO  L78                 Accepts]: Start accepts. Automaton has 6739 states and 7986 transitions. Word has length 208
[2025-02-05 11:33:48,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:48,017 INFO  L471      AbstractCegarLoop]: Abstraction has 6739 states and 7986 transitions.
[2025-02-05 11:33:48,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:48,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 6739 states and 7986 transitions.
[2025-02-05 11:33:48,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 11:33:48,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:48,019 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:48,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:33:48,019 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:48,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:48,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -892622373, now seen corresponding path program 1 times
[2025-02-05 11:33:48,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:48,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820667468]
[2025-02-05 11:33:48,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:48,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:48,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 11:33:48,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 11:33:48,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:48,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:48,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2025-02-05 11:33:48,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:48,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820667468]
[2025-02-05 11:33:48,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820667468] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:48,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:48,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:48,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954564079]
[2025-02-05 11:33:48,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:48,203 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:48,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:48,204 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:48,204 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:48,204 INFO  L87              Difference]: Start difference. First operand 6739 states and 7986 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:48,861 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:48,861 INFO  L93              Difference]: Finished difference Result 14609 states and 17403 transitions.
[2025-02-05 11:33:48,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:48,862 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 228
[2025-02-05 11:33:48,862 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:48,887 INFO  L225             Difference]: With dead ends: 14609
[2025-02-05 11:33:48,887 INFO  L226             Difference]: Without dead ends: 7872
[2025-02-05 11:33:48,897 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 11:33:48,897 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 176 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:48,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 208 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:33:48,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7872 states.
[2025-02-05 11:33:48,972 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7872 to 7659.
[2025-02-05 11:33:48,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7659 states, 7658 states have (on average 1.1880386523896578) internal successors, (9098), 7658 states have internal predecessors, (9098), 0 states have call successors, (0), 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 11:33:48,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7659 states to 7659 states and 9098 transitions.
[2025-02-05 11:33:48,994 INFO  L78                 Accepts]: Start accepts. Automaton has 7659 states and 9098 transitions. Word has length 228
[2025-02-05 11:33:48,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:48,994 INFO  L471      AbstractCegarLoop]: Abstraction has 7659 states and 9098 transitions.
[2025-02-05 11:33:48,994 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:48,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 7659 states and 9098 transitions.
[2025-02-05 11:33:48,996 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-02-05 11:33:48,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:48,999 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:48,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:33:48,999 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:49,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:49,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 1247327848, now seen corresponding path program 1 times
[2025-02-05 11:33:49,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:49,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27521960]
[2025-02-05 11:33:49,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:49,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:49,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-02-05 11:33:49,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-02-05 11:33:49,065 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:49,065 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:49,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-02-05 11:33:49,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:49,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27521960]
[2025-02-05 11:33:49,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27521960] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:49,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:49,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:49,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063536930]
[2025-02-05 11:33:49,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:49,195 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:49,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:49,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:49,196 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:49,196 INFO  L87              Difference]: Start difference. First operand 7659 states and 9098 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:49,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:49,842 INFO  L93              Difference]: Finished difference Result 15327 states and 18216 transitions.
[2025-02-05 11:33:49,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:49,842 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235
[2025-02-05 11:33:49,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:49,862 INFO  L225             Difference]: With dead ends: 15327
[2025-02-05 11:33:49,862 INFO  L226             Difference]: Without dead ends: 7670
[2025-02-05 11:33:49,869 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 11:33:49,870 INFO  L435           NwaCegarLoop]: 356 mSDtfsCounter, 175 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:49,870 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:33:49,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7670 states.
[2025-02-05 11:33:49,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7474.
[2025-02-05 11:33:49,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7474 states, 7473 states have (on average 1.164324902984076) internal successors, (8701), 7473 states have internal predecessors, (8701), 0 states have call successors, (0), 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 11:33:49,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 8701 transitions.
[2025-02-05 11:33:49,987 INFO  L78                 Accepts]: Start accepts. Automaton has 7474 states and 8701 transitions. Word has length 235
[2025-02-05 11:33:49,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:49,987 INFO  L471      AbstractCegarLoop]: Abstraction has 7474 states and 8701 transitions.
[2025-02-05 11:33:49,988 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 11:33:49,988 INFO  L276                IsEmpty]: Start isEmpty. Operand 7474 states and 8701 transitions.
[2025-02-05 11:33:49,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 259
[2025-02-05 11:33:49,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:49,991 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:49,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:33:49,991 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:49,995 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:49,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227299026, now seen corresponding path program 1 times
[2025-02-05 11:33:49,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:49,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492750175]
[2025-02-05 11:33:49,995 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:49,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:50,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes.
[2025-02-05 11:33:50,031 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements.
[2025-02-05 11:33:50,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:50,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:50,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked.
[2025-02-05 11:33:50,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:50,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492750175]
[2025-02-05 11:33:50,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492750175] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:50,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:50,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:50,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261876475]
[2025-02-05 11:33:50,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:50,211 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:50,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:50,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:50,212 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:50,212 INFO  L87              Difference]: Start difference. First operand 7474 states and 8701 transitions. Second operand  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 11:33:50,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:50,814 INFO  L93              Difference]: Finished difference Result 15872 states and 18630 transitions.
[2025-02-05 11:33:50,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:50,815 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 258
[2025-02-05 11:33:50,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:50,827 INFO  L225             Difference]: With dead ends: 15872
[2025-02-05 11:33:50,827 INFO  L226             Difference]: Without dead ends: 8400
[2025-02-05 11:33:50,834 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 11:33:50,834 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 198 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:50,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:33:50,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8400 states.
[2025-02-05 11:33:50,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 7474.
[2025-02-05 11:33:50,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7474 states, 7473 states have (on average 1.164324902984076) internal successors, (8701), 7473 states have internal predecessors, (8701), 0 states have call successors, (0), 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 11:33:50,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 8701 transitions.
[2025-02-05 11:33:50,912 INFO  L78                 Accepts]: Start accepts. Automaton has 7474 states and 8701 transitions. Word has length 258
[2025-02-05 11:33:50,912 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:50,912 INFO  L471      AbstractCegarLoop]: Abstraction has 7474 states and 8701 transitions.
[2025-02-05 11:33:50,913 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 11:33:50,913 INFO  L276                IsEmpty]: Start isEmpty. Operand 7474 states and 8701 transitions.
[2025-02-05 11:33:50,915 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2025-02-05 11:33:50,915 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:50,916 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:50,916 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:33:50,916 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:50,916 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:50,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -440671699, now seen corresponding path program 1 times
[2025-02-05 11:33:50,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:50,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247224062]
[2025-02-05 11:33:50,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:50,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:50,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-05 11:33:50,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-05 11:33:50,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:50,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:51,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2025-02-05 11:33:51,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:51,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247224062]
[2025-02-05 11:33:51,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247224062] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:51,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:51,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:51,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331136441]
[2025-02-05 11:33:51,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:51,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:33:51,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:51,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:33:51,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:33:51,242 INFO  L87              Difference]: Start difference. First operand 7474 states and 8701 transitions. Second operand  has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 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 11:33:52,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:52,789 INFO  L93              Difference]: Finished difference Result 22156 states and 26225 transitions.
[2025-02-05 11:33:52,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:33:52,790 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 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) Word has length 261
[2025-02-05 11:33:52,791 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:52,823 INFO  L225             Difference]: With dead ends: 22156
[2025-02-05 11:33:52,823 INFO  L226             Difference]: Without dead ends: 14684
[2025-02-05 11:33:52,834 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:33:52,838 INFO  L435           NwaCegarLoop]: 39 mSDtfsCounter, 259 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:52,838 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 76 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 11:33:52,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14684 states.
[2025-02-05 11:33:53,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14479.
[2025-02-05 11:33:53,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14479 states, 14478 states have (on average 1.1688769167012019) internal successors, (16923), 14478 states have internal predecessors, (16923), 0 states have call successors, (0), 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 11:33:53,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 16923 transitions.
[2025-02-05 11:33:53,057 INFO  L78                 Accepts]: Start accepts. Automaton has 14479 states and 16923 transitions. Word has length 261
[2025-02-05 11:33:53,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:53,058 INFO  L471      AbstractCegarLoop]: Abstraction has 14479 states and 16923 transitions.
[2025-02-05 11:33:53,058 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 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 11:33:53,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 14479 states and 16923 transitions.
[2025-02-05 11:33:53,063 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 271
[2025-02-05 11:33:53,063 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:53,064 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:53,064 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:33:53,064 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:53,065 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:53,065 INFO  L85        PathProgramCache]: Analyzing trace with hash 806503048, now seen corresponding path program 1 times
[2025-02-05 11:33:53,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:53,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266203679]
[2025-02-05 11:33:53,065 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:53,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:53,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes.
[2025-02-05 11:33:53,114 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements.
[2025-02-05 11:33:53,114 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:53,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:53,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:53,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:53,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266203679]
[2025-02-05 11:33:53,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266203679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:53,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:53,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:53,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61263531]
[2025-02-05 11:33:53,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:53,239 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:33:53,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:53,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:33:53,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:33:53,239 INFO  L87              Difference]: Start difference. First operand 14479 states and 16923 transitions. Second operand  has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 11:33:54,241 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:54,242 INFO  L93              Difference]: Finished difference Result 37092 states and 43497 transitions.
[2025-02-05 11:33:54,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:33:54,242 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270
[2025-02-05 11:33:54,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:54,272 INFO  L225             Difference]: With dead ends: 37092
[2025-02-05 11:33:54,272 INFO  L226             Difference]: Without dead ends: 22983
[2025-02-05 11:33:54,287 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:33:54,287 INFO  L435           NwaCegarLoop]: 45 mSDtfsCounter, 262 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:54,287 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 90 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:33:54,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22983 states.
[2025-02-05 11:33:54,557 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22983 to 22429.
[2025-02-05 11:33:54,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22429 states, 22428 states have (on average 1.1685393258426966) internal successors, (26208), 22428 states have internal predecessors, (26208), 0 states have call successors, (0), 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 11:33:54,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22429 states to 22429 states and 26208 transitions.
[2025-02-05 11:33:54,602 INFO  L78                 Accepts]: Start accepts. Automaton has 22429 states and 26208 transitions. Word has length 270
[2025-02-05 11:33:54,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:54,603 INFO  L471      AbstractCegarLoop]: Abstraction has 22429 states and 26208 transitions.
[2025-02-05 11:33:54,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 11:33:54,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 22429 states and 26208 transitions.
[2025-02-05 11:33:54,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2025-02-05 11:33:54,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:54,608 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:54,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:33:54,609 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:54,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:54,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -420282327, now seen corresponding path program 1 times
[2025-02-05 11:33:54,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:54,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327136435]
[2025-02-05 11:33:54,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:54,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:54,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes.
[2025-02-05 11:33:54,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements.
[2025-02-05 11:33:54,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:54,643 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:54,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 284 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-02-05 11:33:54,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:54,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327136435]
[2025-02-05 11:33:54,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327136435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:54,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:54,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:54,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971764224]
[2025-02-05 11:33:54,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:54,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:54,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:54,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:54,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:54,709 INFO  L87              Difference]: Start difference. First operand 22429 states and 26208 transitions. Second operand  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:55,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:55,281 INFO  L93              Difference]: Finished difference Result 41663 states and 48774 transitions.
[2025-02-05 11:33:55,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:55,282 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284
[2025-02-05 11:33:55,283 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:55,310 INFO  L225             Difference]: With dead ends: 41663
[2025-02-05 11:33:55,311 INFO  L226             Difference]: Without dead ends: 18129
[2025-02-05 11:33:55,327 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 11:33:55,328 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:55,328 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 149 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:33:55,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18129 states.
[2025-02-05 11:33:55,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 17389.
[2025-02-05 11:33:55,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17389 states, 17388 states have (on average 1.1192776627559236) internal successors, (19462), 17388 states have internal predecessors, (19462), 0 states have call successors, (0), 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 11:33:55,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17389 states to 17389 states and 19462 transitions.
[2025-02-05 11:33:55,605 INFO  L78                 Accepts]: Start accepts. Automaton has 17389 states and 19462 transitions. Word has length 284
[2025-02-05 11:33:55,606 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:55,606 INFO  L471      AbstractCegarLoop]: Abstraction has 17389 states and 19462 transitions.
[2025-02-05 11:33:55,606 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:55,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 17389 states and 19462 transitions.
[2025-02-05 11:33:55,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 302
[2025-02-05 11:33:55,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:55,611 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:55,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:33:55,611 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:55,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:55,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -305809576, now seen corresponding path program 1 times
[2025-02-05 11:33:55,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:55,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694530456]
[2025-02-05 11:33:55,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:55,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:55,633 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes.
[2025-02-05 11:33:55,645 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements.
[2025-02-05 11:33:55,645 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:55,645 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:55,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-02-05 11:33:55,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:55,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694530456]
[2025-02-05 11:33:55,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694530456] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:55,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:55,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:55,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142144412]
[2025-02-05 11:33:55,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:55,712 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:55,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:55,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:55,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:55,712 INFO  L87              Difference]: Start difference. First operand 17389 states and 19462 transitions. Second operand  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 11:33:56,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:56,334 INFO  L93              Difference]: Finished difference Result 37352 states and 41901 transitions.
[2025-02-05 11:33:56,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:56,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 301
[2025-02-05 11:33:56,335 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:56,360 INFO  L225             Difference]: With dead ends: 37352
[2025-02-05 11:33:56,361 INFO  L226             Difference]: Without dead ends: 20333
[2025-02-05 11:33:56,374 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 11:33:56,375 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:56,375 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 150 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:33:56,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20333 states.
[2025-02-05 11:33:56,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20333 to 20148.
[2025-02-05 11:33:56,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20148 states, 20147 states have (on average 1.1009083238199235) internal successors, (22180), 20147 states have internal predecessors, (22180), 0 states have call successors, (0), 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 11:33:56,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20148 states to 20148 states and 22180 transitions.
[2025-02-05 11:33:56,726 INFO  L78                 Accepts]: Start accepts. Automaton has 20148 states and 22180 transitions. Word has length 301
[2025-02-05 11:33:56,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:56,726 INFO  L471      AbstractCegarLoop]: Abstraction has 20148 states and 22180 transitions.
[2025-02-05 11:33:56,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 11:33:56,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 20148 states and 22180 transitions.
[2025-02-05 11:33:56,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 302
[2025-02-05 11:33:56,733 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:56,733 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:56,733 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:33:56,733 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:56,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:56,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -797912152, now seen corresponding path program 1 times
[2025-02-05 11:33:56,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:56,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796755353]
[2025-02-05 11:33:56,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:56,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:56,763 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes.
[2025-02-05 11:33:56,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements.
[2025-02-05 11:33:56,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:56,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:56,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 305 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked.
[2025-02-05 11:33:56,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:56,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796755353]
[2025-02-05 11:33:56,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796755353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:56,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:56,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:56,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039833954]
[2025-02-05 11:33:56,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:56,872 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:56,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:56,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:56,873 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:56,873 INFO  L87              Difference]: Start difference. First operand 20148 states and 22180 transitions. Second operand  has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 11:33:57,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:57,461 INFO  L93              Difference]: Finished difference Result 40473 states and 44630 transitions.
[2025-02-05 11:33:57,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:57,462 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 301
[2025-02-05 11:33:57,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:57,485 INFO  L225             Difference]: With dead ends: 40473
[2025-02-05 11:33:57,486 INFO  L226             Difference]: Without dead ends: 22723
[2025-02-05 11:33:57,501 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 11:33:57,502 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 193 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:57,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 139 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:33:57,518 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22723 states.
[2025-02-05 11:33:57,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22723 to 15907.
[2025-02-05 11:33:57,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15907 states, 15906 states have (on average 1.1015968816798691) internal successors, (17522), 15906 states have internal predecessors, (17522), 0 states have call successors, (0), 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 11:33:57,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 17522 transitions.
[2025-02-05 11:33:57,899 INFO  L78                 Accepts]: Start accepts. Automaton has 15907 states and 17522 transitions. Word has length 301
[2025-02-05 11:33:57,899 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:57,899 INFO  L471      AbstractCegarLoop]: Abstraction has 15907 states and 17522 transitions.
[2025-02-05 11:33:57,899 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 11:33:57,899 INFO  L276                IsEmpty]: Start isEmpty. Operand 15907 states and 17522 transitions.
[2025-02-05 11:33:57,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 309
[2025-02-05 11:33:57,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:57,904 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:57,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:33:57,904 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:57,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:57,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 531321905, now seen corresponding path program 1 times
[2025-02-05 11:33:57,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:57,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062257908]
[2025-02-05 11:33:57,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:57,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:57,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes.
[2025-02-05 11:33:57,938 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements.
[2025-02-05 11:33:57,939 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:57,939 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:58,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-02-05 11:33:58,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:58,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062257908]
[2025-02-05 11:33:58,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062257908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:58,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:58,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:58,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118762699]
[2025-02-05 11:33:58,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:58,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:58,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:58,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:58,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:58,019 INFO  L87              Difference]: Start difference. First operand 15907 states and 17522 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 11:33:58,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:58,352 INFO  L93              Difference]: Finished difference Result 30696 states and 33815 transitions.
[2025-02-05 11:33:58,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:58,353 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 308
[2025-02-05 11:33:58,353 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:58,371 INFO  L225             Difference]: With dead ends: 30696
[2025-02-05 11:33:58,371 INFO  L226             Difference]: Without dead ends: 15159
[2025-02-05 11:33:58,383 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:58,384 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:58,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 35 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 11:33:58,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15159 states.
[2025-02-05 11:33:58,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 15157.
[2025-02-05 11:33:58,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15157 states, 15156 states have (on average 1.0995645288994458) internal successors, (16665), 15156 states have internal predecessors, (16665), 0 states have call successors, (0), 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 11:33:58,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15157 states to 15157 states and 16665 transitions.
[2025-02-05 11:33:58,532 INFO  L78                 Accepts]: Start accepts. Automaton has 15157 states and 16665 transitions. Word has length 308
[2025-02-05 11:33:58,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:58,533 INFO  L471      AbstractCegarLoop]: Abstraction has 15157 states and 16665 transitions.
[2025-02-05 11:33:58,533 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 11:33:58,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 15157 states and 16665 transitions.
[2025-02-05 11:33:58,537 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2025-02-05 11:33:58,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:58,538 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:58,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:33:58,538 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:58,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:58,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 961026923, now seen corresponding path program 1 times
[2025-02-05 11:33:58,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:58,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496623467]
[2025-02-05 11:33:58,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:58,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:58,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes.
[2025-02-05 11:33:58,579 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements.
[2025-02-05 11:33:58,579 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:58,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:58,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked.
[2025-02-05 11:33:58,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:58,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496623467]
[2025-02-05 11:33:58,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496623467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:58,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:58,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:58,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72260931]
[2025-02-05 11:33:58,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:58,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:58,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:58,851 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:58,851 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:58,852 INFO  L87              Difference]: Start difference. First operand 15157 states and 16665 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:59,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:59,565 INFO  L93              Difference]: Finished difference Result 33630 states and 37051 transitions.
[2025-02-05 11:33:59,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:59,566 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330
[2025-02-05 11:33:59,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:59,602 INFO  L225             Difference]: With dead ends: 33630
[2025-02-05 11:33:59,605 INFO  L226             Difference]: Without dead ends: 18843
[2025-02-05 11:33:59,627 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 11:33:59,629 INFO  L435           NwaCegarLoop]: 319 mSDtfsCounter, 179 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:59,629 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 341 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:33:59,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18843 states.
[2025-02-05 11:33:59,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18843 to 16264.
[2025-02-05 11:33:59,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16264 states, 16263 states have (on average 1.0927873086146467) internal successors, (17772), 16263 states have internal predecessors, (17772), 0 states have call successors, (0), 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 11:33:59,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 17772 transitions.
[2025-02-05 11:33:59,927 INFO  L78                 Accepts]: Start accepts. Automaton has 16264 states and 17772 transitions. Word has length 330
[2025-02-05 11:33:59,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:59,927 INFO  L471      AbstractCegarLoop]: Abstraction has 16264 states and 17772 transitions.
[2025-02-05 11:33:59,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:59,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 16264 states and 17772 transitions.
[2025-02-05 11:33:59,932 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 338
[2025-02-05 11:33:59,932 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:59,932 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:59,933 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 11:33:59,933 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:59,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:59,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -502352420, now seen corresponding path program 1 times
[2025-02-05 11:33:59,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:59,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114922184]
[2025-02-05 11:33:59,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:59,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:59,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes.
[2025-02-05 11:34:00,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements.
[2025-02-05 11:34:00,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:34:00,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:34:00,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked.
[2025-02-05 11:34:00,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:34:00,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114922184]
[2025-02-05 11:34:00,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114922184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:34:00,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:34:00,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:34:00,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403939061]
[2025-02-05 11:34:00,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:34:00,161 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:34:00,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:34:00,161 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:34:00,161 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:34:00,161 INFO  L87              Difference]: Start difference. First operand 16264 states and 17772 transitions. Second operand  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 11:34:00,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:34:00,875 INFO  L93              Difference]: Finished difference Result 33444 states and 36541 transitions.
[2025-02-05 11:34:00,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:34:00,876 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 337
[2025-02-05 11:34:00,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:34:00,877 INFO  L225             Difference]: With dead ends: 33444
[2025-02-05 11:34:00,880 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:34:00,899 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 11:34:00,900 INFO  L435           NwaCegarLoop]: 286 mSDtfsCounter, 187 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:34:00,900 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 300 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:34:00,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:34:00,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:34:00,904 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 11:34:00,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:34:00,905 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 337
[2025-02-05 11:34:00,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:34:00,905 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:34:00,905 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 11:34:00,905 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:34:00,905 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:34:00,907 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:34:00,907 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 11:34:00,914 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:34:00,919 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:34:03,942 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:34:03,957 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:34:03 BoogieIcfgContainer
[2025-02-05 11:34:03,958 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:34:03,958 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:34:03,958 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:34:03,958 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:34:03,959 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:38" (3/4) ...
[2025-02-05 11:34:03,960 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:34:03,975 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-02-05 11:34:03,976 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:34:03,977 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:34:03,978 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:34:04,135 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:34:04,135 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:34:04,135 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:34:04,136 INFO  L158              Benchmark]: Toolchain (without parser) took 28565.13ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 131.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 266.8MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,136 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:34:04,136 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 638.52ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 87.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,137 INFO  L158              Benchmark]: Boogie Procedure Inliner took 199.70ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 71.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,137 INFO  L158              Benchmark]: Boogie Preprocessor took 225.35ms. Allocated memory is still 167.8MB. Free memory was 71.0MB in the beginning and 47.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,137 INFO  L158              Benchmark]: IcfgBuilder took 1586.28ms. Allocated memory is still 167.8MB. Free memory was 47.5MB in the beginning and 106.4MB in the end (delta: -58.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,137 INFO  L158              Benchmark]: TraceAbstraction took 25731.88ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 106.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,137 INFO  L158              Benchmark]: Witness Printer took 177.16ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:34:04,138 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 638.52ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 87.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 199.70ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 71.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 225.35ms. Allocated memory is still 167.8MB. Free memory was 71.0MB in the beginning and 47.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1586.28ms. Allocated memory is still 167.8MB. Free memory was 47.5MB in the beginning and 106.4MB in the end (delta: -58.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 25731.88ms. Allocated memory was 167.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 106.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB.
 * Witness Printer took 177.16ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. 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: 94]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3688 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3688 mSDsluCounter, 3975 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 1900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11277 IncrementalHoareTripleChecker+Invalid, 13177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1900 mSolverCounterUnsat, 3523 mSDtfsCounter, 11277 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22429occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 12651 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 4102 NumberOfCodeBlocks, 4102 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4084 ConstructedInterpolants, 0 QuantifiedInterpolants, 7783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2709/2709 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 1044]: Location Invariant
    Derived location invariant: (((((((((((((((((((((((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a23 <= 138)) && (a8 == 15)) || ((((a4 == 0) && (a25 == 11)) && (a8 == 15)) && (a23 <= 137))) || (((a25 == 13) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a23 <= 137))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 137)) && (130 <= a29))) || ((((a25 == 11) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 137)) && (a29 <= 130))) || (((a4 == 1) && (a25 == 10)) && (a23 <= 137))) || ((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((a4 == 0) && (a25 == 11)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a25 == 13) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((262 <= a29) && (a4 == 0)) && (a25 <= 10)) && (a8 == 15)) && (a23 <= 137))) || (((a4 == 1) && (a8 == 15)) && (a25 == 10))) || (((((307 <= a23) && (a25 <= 10)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || ((((a29 <= 140) && (a4 == 1)) && ((((a25 <= 10) && (a3 == 1)) && (a25 != 9)) || ((a25 == 12) && (a3 == 1)))) && (a8 == 15))) || (((((a29 <= 140) && (a25 <= 10)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((a25 <= 10) && (a4 == 1)) && (a8 == 15)) && (247 <= a29))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a23 <= 138)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 1)) && (a8 == 15)) && (130 <= a29)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:34:04,171 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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