./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label48.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/Problem18_label48.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 e9155a2684e1f8950a36d91357f02e75fcaa2df79c995c3208e0ecb15ab33697
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:12:23,425 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:12:23,482 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 12:12:23,485 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:12:23,488 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:12:23,511 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:12:23,515 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:12:23,515 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:12:23,515 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:12:23,515 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:12:23,515 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:12:23,515 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:12:23,515 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:12:23,515 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:12:23,515 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:12:23,516 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:12:23,516 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:12:23,516 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:12:23,517 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:12:23,517 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:12:23,518 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:12:23,518 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:12:23,518 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 -> e9155a2684e1f8950a36d91357f02e75fcaa2df79c995c3208e0ecb15ab33697
[2025-02-05 12:12:23,816 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:12:23,825 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:12:23,831 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:12:23,832 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:12:23,832 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:12:23,833 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label48.c
[2025-02-05 12:12:25,090 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4752af5d7/19e2b9811ba442fc8c534a6f89c6ead3/FLAG8d7572a27
[2025-02-05 12:12:25,565 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:12:25,566 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label48.c
[2025-02-05 12:12:25,600 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4752af5d7/19e2b9811ba442fc8c534a6f89c6ead3/FLAG8d7572a27
[2025-02-05 12:12:25,616 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4752af5d7/19e2b9811ba442fc8c534a6f89c6ead3
[2025-02-05 12:12:25,618 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:12:25,620 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:12:25,622 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:12:25,622 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:12:25,625 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:12:25,626 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:12:25" (1/1) ...
[2025-02-05 12:12:25,627 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8aac859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:25, skipping insertion in model container
[2025-02-05 12:12:25,628 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:12:25" (1/1) ...
[2025-02-05 12:12:25,704 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:12:25,859 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/Problem18_label48.c[5703,5716]
[2025-02-05 12:12:26,247 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:12:26,254 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:12:26,295 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/Problem18_label48.c[5703,5716]
[2025-02-05 12:12:26,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:12:26,499 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:12:26,499 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26 WrapperNode
[2025-02-05 12:12:26,499 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:12:26,501 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:12:26,501 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:12:26,501 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:12:26,506 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,531 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,679 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-02-05 12:12:26,680 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:12:26,680 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:12:26,680 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:12:26,680 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:12:26,687 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,688 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,715 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,806 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 12:12:26,806 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,807 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,847 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,860 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,871 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,878 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,896 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:12:26,897 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:12:26,897 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:12:26,898 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:12:26,898 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (1/1) ...
[2025-02-05 12:12:26,902 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:12:26,911 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:12:26,922 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 12:12:26,924 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 12:12:26,939 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:12:26,939 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:12:26,939 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:12:26,940 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:12:27,006 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:12:27,007 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:12:29,791 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-02-05 12:12:29,792 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-02-05 12:12:29,943 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-02-05 12:12:29,943 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:12:29,972 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:12:29,981 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:12:29,981 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:12:29 BoogieIcfgContainer
[2025-02-05 12:12:29,981 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:12:29,982 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:12:29,982 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:12:29,986 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:12:29,986 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:12:25" (1/3) ...
[2025-02-05 12:12:29,986 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dc083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:12:29, skipping insertion in model container
[2025-02-05 12:12:29,986 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:12:26" (2/3) ...
[2025-02-05 12:12:29,987 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dc083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:12:29, skipping insertion in model container
[2025-02-05 12:12:29,987 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:12:29" (3/3) ...
[2025-02-05 12:12:29,987 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label48.c
[2025-02-05 12:12:29,996 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:12:29,998 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label48.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:12:30,039 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:12:30,047 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;@1c9715cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:12:30,047 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:12:30,052 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 12:12:30,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2025-02-05 12:12:30,056 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:30,057 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:30,057 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:30,060 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:30,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -1295158858, now seen corresponding path program 1 times
[2025-02-05 12:12:30,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:30,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401792585]
[2025-02-05 12:12:30,066 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:30,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:30,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes.
[2025-02-05 12:12:30,135 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements.
[2025-02-05 12:12:30,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:30,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:30,273 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 12:12:30,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:30,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401792585]
[2025-02-05 12:12:30,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401792585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:30,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:30,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:12:30,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111490907]
[2025-02-05 12:12:30,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:30,281 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:30,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:30,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:30,295 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:30,299 INFO  L87              Difference]: Start difference. First operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 12:12:33,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:33,080 INFO  L93              Difference]: Finished difference Result 2221 states and 4279 transitions.
[2025-02-05 12:12:33,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:33,083 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54
[2025-02-05 12:12:33,083 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:33,093 INFO  L225             Difference]: With dead ends: 2221
[2025-02-05 12:12:33,093 INFO  L226             Difference]: Without dead ends: 1384
[2025-02-05 12:12:33,096 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 12:12:33,098 INFO  L435           NwaCegarLoop]: 478 mSDtfsCounter, 741 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:33,099 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 12:12:33,110 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1384 states.
[2025-02-05 12:12:33,151 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384.
[2025-02-05 12:12:33,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 0 states have call successors, (0), 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 12:12:33,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions.
[2025-02-05 12:12:33,167 INFO  L78                 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 54
[2025-02-05 12:12:33,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:33,168 INFO  L471      AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions.
[2025-02-05 12:12:33,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 12:12:33,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions.
[2025-02-05 12:12:33,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-02-05 12:12:33,171 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:33,172 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:33,172 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:12:33,172 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:33,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:33,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 1532450409, now seen corresponding path program 1 times
[2025-02-05 12:12:33,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:33,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500447152]
[2025-02-05 12:12:33,173 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:33,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:33,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-02-05 12:12:33,270 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-02-05 12:12:33,270 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:33,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:33,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:12:33,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:33,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500447152]
[2025-02-05 12:12:33,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500447152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:33,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:33,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:12:33,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252181612]
[2025-02-05 12:12:33,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:33,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:33,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:33,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:33,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:33,453 INFO  L87              Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:35,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:35,761 INFO  L93              Difference]: Finished difference Result 4146 states and 6631 transitions.
[2025-02-05 12:12:35,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:35,762 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119
[2025-02-05 12:12:35,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:35,775 INFO  L225             Difference]: With dead ends: 4146
[2025-02-05 12:12:35,775 INFO  L226             Difference]: Without dead ends: 2764
[2025-02-05 12:12:35,780 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 12:12:35,781 INFO  L435           NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:35,781 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:12:35,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2764 states.
[2025-02-05 12:12:35,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764.
[2025-02-05 12:12:35,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 0 states have call successors, (0), 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 12:12:35,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions.
[2025-02-05 12:12:35,820 INFO  L78                 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 119
[2025-02-05 12:12:35,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:35,820 INFO  L471      AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions.
[2025-02-05 12:12:35,820 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:35,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions.
[2025-02-05 12:12:35,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2025-02-05 12:12:35,826 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:35,826 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:35,826 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:12:35,826 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:35,827 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:35,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1661768183, now seen corresponding path program 1 times
[2025-02-05 12:12:35,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:35,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910306370]
[2025-02-05 12:12:35,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:35,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:35,857 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-02-05 12:12:35,870 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-02-05 12:12:35,870 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:35,870 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:36,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2025-02-05 12:12:36,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:36,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910306370]
[2025-02-05 12:12:36,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910306370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:36,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:36,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:36,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975633312]
[2025-02-05 12:12:36,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:36,510 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:12:36,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:36,510 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:12:36,510 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:12:36,511 INFO  L87              Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand  has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 12:12:39,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:39,696 INFO  L93              Difference]: Finished difference Result 7596 states and 9794 transitions.
[2025-02-05 12:12:39,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:12:39,697 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 237
[2025-02-05 12:12:39,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:39,719 INFO  L225             Difference]: With dead ends: 7596
[2025-02-05 12:12:39,720 INFO  L226             Difference]: Without dead ends: 4834
[2025-02-05 12:12:39,723 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 12:12:39,723 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:39,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-02-05 12:12:39,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4834 states.
[2025-02-05 12:12:39,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144.
[2025-02-05 12:12:39,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 0 states have call successors, (0), 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 12:12:39,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions.
[2025-02-05 12:12:39,778 INFO  L78                 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 237
[2025-02-05 12:12:39,779 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:39,779 INFO  L471      AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions.
[2025-02-05 12:12:39,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 12:12:39,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions.
[2025-02-05 12:12:39,782 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-05 12:12:39,782 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:39,783 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:39,783 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:12:39,783 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:39,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:39,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 329272812, now seen corresponding path program 1 times
[2025-02-05 12:12:39,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:39,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315876131]
[2025-02-05 12:12:39,784 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:39,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:39,811 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-05 12:12:39,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-05 12:12:39,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:39,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:40,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-02-05 12:12:40,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:40,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315876131]
[2025-02-05 12:12:40,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315876131] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:12:40,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371907428]
[2025-02-05 12:12:40,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:40,302 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:40,302 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:12:40,304 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:12:40,309 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 12:12:40,355 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-05 12:12:40,403 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-05 12:12:40,403 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:40,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:40,405 INFO  L256         TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:12:40,412 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:12:40,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-05 12:12:40,799 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:12:40,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [371907428] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:40,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:12:40,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 12:12:40,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767527425]
[2025-02-05 12:12:40,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:40,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:40,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:40,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:40,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:12:40,800 INFO  L87              Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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 12:12:42,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:42,900 INFO  L93              Difference]: Finished difference Result 12426 states and 15778 transitions.
[2025-02-05 12:12:42,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:42,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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 353
[2025-02-05 12:12:42,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:42,918 INFO  L225             Difference]: With dead ends: 12426
[2025-02-05 12:12:42,918 INFO  L226             Difference]: Without dead ends: 8284
[2025-02-05 12:12:42,921 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:12:42,922 INFO  L435           NwaCegarLoop]: 544 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:42,922 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 550 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:12:42,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8284 states.
[2025-02-05 12:12:42,991 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 6904.
[2025-02-05 12:12:42,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 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 12:12:43,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions.
[2025-02-05 12:12:43,006 INFO  L78                 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 353
[2025-02-05 12:12:43,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:43,007 INFO  L471      AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions.
[2025-02-05 12:12:43,007 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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 12:12:43,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions.
[2025-02-05 12:12:43,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 424
[2025-02-05 12:12:43,011 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:43,011 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:12:43,020 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 12:12:43,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:43,212 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:43,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:43,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 1142318299, now seen corresponding path program 1 times
[2025-02-05 12:12:43,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:43,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871736705]
[2025-02-05 12:12:43,213 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:43,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:43,255 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes.
[2025-02-05 12:12:43,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements.
[2025-02-05 12:12:43,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:43,308 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:43,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 409 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2025-02-05 12:12:43,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:43,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871736705]
[2025-02-05 12:12:43,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871736705] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:43,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:43,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:43,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908027944]
[2025-02-05 12:12:43,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:43,739 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:12:43,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:43,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:12:43,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:12:43,740 INFO  L87              Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand  has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 12:12:45,674 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:45,674 INFO  L93              Difference]: Finished difference Result 15239 states and 18535 transitions.
[2025-02-05 12:12:45,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:12:45,675 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 423
[2025-02-05 12:12:45,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:45,694 INFO  L225             Difference]: With dead ends: 15239
[2025-02-05 12:12:45,695 INFO  L226             Difference]: Without dead ends: 8284
[2025-02-05 12:12:45,700 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 12:12:45,702 INFO  L435           NwaCegarLoop]: 625 mSDtfsCounter, 513 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:45,702 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 640 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:12:45,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8284 states.
[2025-02-05 12:12:45,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284.
[2025-02-05 12:12:45,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 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 12:12:45,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions.
[2025-02-05 12:12:45,825 INFO  L78                 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 423
[2025-02-05 12:12:45,826 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:45,826 INFO  L471      AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions.
[2025-02-05 12:12:45,826 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 12:12:45,826 INFO  L276                IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions.
[2025-02-05 12:12:45,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 439
[2025-02-05 12:12:45,832 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:45,832 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:45,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 12:12:45,833 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:45,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:45,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 613827585, now seen corresponding path program 1 times
[2025-02-05 12:12:45,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:45,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300186171]
[2025-02-05 12:12:45,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:45,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:45,858 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes.
[2025-02-05 12:12:45,875 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements.
[2025-02-05 12:12:45,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:45,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:46,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 12:12:46,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:46,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300186171]
[2025-02-05 12:12:46,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300186171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:46,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:46,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:12:46,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692165575]
[2025-02-05 12:12:46,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:46,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:46,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:46,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:46,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:46,136 INFO  L87              Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 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 12:12:47,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:47,989 INFO  L93              Difference]: Finished difference Result 20016 states and 22949 transitions.
[2025-02-05 12:12:47,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:47,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 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 438
[2025-02-05 12:12:47,990 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:48,032 INFO  L225             Difference]: With dead ends: 20016
[2025-02-05 12:12:48,032 INFO  L226             Difference]: Without dead ends: 11734
[2025-02-05 12:12:48,039 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 12:12:48,040 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:48,040 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 12:12:48,047 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11734 states.
[2025-02-05 12:12:48,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734.
[2025-02-05 12:12:48,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 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 12:12:48,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions.
[2025-02-05 12:12:48,164 INFO  L78                 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 438
[2025-02-05 12:12:48,164 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:48,166 INFO  L471      AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions.
[2025-02-05 12:12:48,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 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 12:12:48,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions.
[2025-02-05 12:12:48,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 447
[2025-02-05 12:12:48,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:48,175 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:48,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:12:48,175 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:48,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:48,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 1871087725, now seen corresponding path program 1 times
[2025-02-05 12:12:48,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:48,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966759561]
[2025-02-05 12:12:48,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:48,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:48,209 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes.
[2025-02-05 12:12:48,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements.
[2025-02-05 12:12:48,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:48,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:48,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:12:48,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:48,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966759561]
[2025-02-05 12:12:48,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966759561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:48,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:48,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:48,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900959601]
[2025-02-05 12:12:48,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:48,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:48,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:48,606 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:48,606 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:48,607 INFO  L87              Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 12:12:50,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:50,194 INFO  L93              Difference]: Finished difference Result 32436 states and 36566 transitions.
[2025-02-05 12:12:50,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:50,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 446
[2025-02-05 12:12:50,196 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:50,221 INFO  L225             Difference]: With dead ends: 32436
[2025-02-05 12:12:50,221 INFO  L226             Difference]: Without dead ends: 20704
[2025-02-05 12:12:50,231 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 12:12:50,232 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 600 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:50,232 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 979 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:12:50,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20704 states.
[2025-02-05 12:12:50,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014.
[2025-02-05 12:12:50,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20014 states, 20013 states have (on average 1.095537900364763) internal successors, (21925), 20013 states have internal predecessors, (21925), 0 states have call successors, (0), 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 12:12:50,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 21925 transitions.
[2025-02-05 12:12:50,441 INFO  L78                 Accepts]: Start accepts. Automaton has 20014 states and 21925 transitions. Word has length 446
[2025-02-05 12:12:50,442 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:50,442 INFO  L471      AbstractCegarLoop]: Abstraction has 20014 states and 21925 transitions.
[2025-02-05 12:12:50,442 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 12:12:50,442 INFO  L276                IsEmpty]: Start isEmpty. Operand 20014 states and 21925 transitions.
[2025-02-05 12:12:50,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-05 12:12:50,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:50,447 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:50,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:12:50,448 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:50,448 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:50,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -1369884918, now seen corresponding path program 1 times
[2025-02-05 12:12:50,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:50,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293220973]
[2025-02-05 12:12:50,449 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:50,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:50,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-05 12:12:50,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-05 12:12:50,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:50,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:50,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-02-05 12:12:50,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:50,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293220973]
[2025-02-05 12:12:50,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293220973] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:50,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:50,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:50,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525583818]
[2025-02-05 12:12:50,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:50,842 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:50,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:50,843 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:50,843 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:50,843 INFO  L87              Difference]: Start difference. First operand 20014 states and 21925 transitions. Second operand  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 12:12:52,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:52,698 INFO  L93              Difference]: Finished difference Result 46236 states and 50984 transitions.
[2025-02-05 12:12:52,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:52,701 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 453
[2025-02-05 12:12:52,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:52,742 INFO  L225             Difference]: With dead ends: 46236
[2025-02-05 12:12:52,744 INFO  L226             Difference]: Without dead ends: 22774
[2025-02-05 12:12:52,759 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 12:12:52,760 INFO  L435           NwaCegarLoop]: 1113 mSDtfsCounter, 650 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:52,760 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1120 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:12:52,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22774 states.
[2025-02-05 12:12:52,926 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 20704.
[2025-02-05 12:12:52,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20704 states, 20703 states have (on average 1.0554025986571995) internal successors, (21850), 20703 states have internal predecessors, (21850), 0 states have call successors, (0), 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 12:12:52,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 21850 transitions.
[2025-02-05 12:12:52,961 INFO  L78                 Accepts]: Start accepts. Automaton has 20704 states and 21850 transitions. Word has length 453
[2025-02-05 12:12:52,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:52,961 INFO  L471      AbstractCegarLoop]: Abstraction has 20704 states and 21850 transitions.
[2025-02-05 12:12:52,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 12:12:52,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 20704 states and 21850 transitions.
[2025-02-05 12:12:52,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 525
[2025-02-05 12:12:52,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:52,967 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:52,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:12:52,967 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:52,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:52,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 354531007, now seen corresponding path program 1 times
[2025-02-05 12:12:52,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:52,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229398783]
[2025-02-05 12:12:52,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:52,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:52,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes.
[2025-02-05 12:12:53,012 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements.
[2025-02-05 12:12:53,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:53,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:53,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 409 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked.
[2025-02-05 12:12:53,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:53,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229398783]
[2025-02-05 12:12:53,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229398783] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:53,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:53,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:53,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368097951]
[2025-02-05 12:12:53,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:53,457 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:53,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:53,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:53,462 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:53,463 INFO  L87              Difference]: Start difference. First operand 20704 states and 21850 transitions. Second operand  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:12:55,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:55,140 INFO  L93              Difference]: Finished difference Result 46236 states and 49051 transitions.
[2025-02-05 12:12:55,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:55,141 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 524
[2025-02-05 12:12:55,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:55,214 INFO  L225             Difference]: With dead ends: 46236
[2025-02-05 12:12:55,214 INFO  L226             Difference]: Without dead ends: 23464
[2025-02-05 12:12:55,223 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 12:12:55,225 INFO  L435           NwaCegarLoop]: 929 mSDtfsCounter, 656 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:55,225 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 936 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:12:55,234 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23464 states.
[2025-02-05 12:12:55,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464.
[2025-02-05 12:12:55,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23464 states, 23463 states have (on average 1.0528065464774325) internal successors, (24702), 23463 states have internal predecessors, (24702), 0 states have call successors, (0), 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 12:12:55,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24702 transitions.
[2025-02-05 12:12:55,438 INFO  L78                 Accepts]: Start accepts. Automaton has 23464 states and 24702 transitions. Word has length 524
[2025-02-05 12:12:55,439 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:55,440 INFO  L471      AbstractCegarLoop]: Abstraction has 23464 states and 24702 transitions.
[2025-02-05 12:12:55,440 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:12:55,440 INFO  L276                IsEmpty]: Start isEmpty. Operand 23464 states and 24702 transitions.
[2025-02-05 12:12:55,450 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 688
[2025-02-05 12:12:55,451 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:55,451 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:12:55,451 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 12:12:55,451 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:55,452 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:55,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -1013175653, now seen corresponding path program 1 times
[2025-02-05 12:12:55,452 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:55,452 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149905084]
[2025-02-05 12:12:55,452 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:55,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:55,504 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes.
[2025-02-05 12:12:55,532 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements.
[2025-02-05 12:12:55,532 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:55,533 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:55,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 573 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-02-05 12:12:55,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:55,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149905084]
[2025-02-05 12:12:55,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149905084] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:55,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:55,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:55,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443164083]
[2025-02-05 12:12:55,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:55,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:55,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:55,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:55,804 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:55,804 INFO  L87              Difference]: Start difference. First operand 23464 states and 24702 transitions. Second operand  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:12:57,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:57,409 INFO  L93              Difference]: Finished difference Result 55206 states and 58466 transitions.
[2025-02-05 12:12:57,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:57,410 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 687
[2025-02-05 12:12:57,410 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:57,448 INFO  L225             Difference]: With dead ends: 55206
[2025-02-05 12:12:57,452 INFO  L226             Difference]: Without dead ends: 31744
[2025-02-05 12:12:57,463 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 12:12:57,467 INFO  L435           NwaCegarLoop]: 839 mSDtfsCounter, 677 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:57,467 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 846 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:12:57,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31744 states.
[2025-02-05 12:12:57,796 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31744.
[2025-02-05 12:12:57,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31744 states, 31743 states have (on average 1.0474435308571968) internal successors, (33249), 31743 states have internal predecessors, (33249), 0 states have call successors, (0), 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 12:12:57,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 33249 transitions.
[2025-02-05 12:12:57,899 INFO  L78                 Accepts]: Start accepts. Automaton has 31744 states and 33249 transitions. Word has length 687
[2025-02-05 12:12:57,900 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:57,903 INFO  L471      AbstractCegarLoop]: Abstraction has 31744 states and 33249 transitions.
[2025-02-05 12:12:57,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 12:12:57,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 31744 states and 33249 transitions.
[2025-02-05 12:12:57,916 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 731
[2025-02-05 12:12:57,919 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:57,920 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:57,920 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:12:57,920 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:57,920 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:57,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -429195958, now seen corresponding path program 1 times
[2025-02-05 12:12:57,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:57,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603504926]
[2025-02-05 12:12:57,920 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:57,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:57,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes.
[2025-02-05 12:12:58,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements.
[2025-02-05 12:12:58,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:58,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:58,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 1100 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked.
[2025-02-05 12:12:58,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:58,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603504926]
[2025-02-05 12:12:58,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603504926] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:58,531 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:58,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:58,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032370565]
[2025-02-05 12:12:58,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:58,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:58,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:58,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:58,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:58,537 INFO  L87              Difference]: Start difference. First operand 31744 states and 33249 transitions. Second operand  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 12:12:59,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:59,563 INFO  L93              Difference]: Finished difference Result 63508 states and 66518 transitions.
[2025-02-05 12:12:59,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:59,563 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 730
[2025-02-05 12:12:59,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:59,593 INFO  L225             Difference]: With dead ends: 63508
[2025-02-05 12:12:59,593 INFO  L226             Difference]: Without dead ends: 31744
[2025-02-05 12:12:59,613 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 12:12:59,614 INFO  L435           NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:59,614 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 986 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 12:12:59,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31744 states.
[2025-02-05 12:12:59,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31744.
[2025-02-05 12:12:59,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31744 states, 31743 states have (on average 1.0473175188230477) internal successors, (33245), 31743 states have internal predecessors, (33245), 0 states have call successors, (0), 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 12:12:59,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 33245 transitions.
[2025-02-05 12:12:59,965 INFO  L78                 Accepts]: Start accepts. Automaton has 31744 states and 33245 transitions. Word has length 730
[2025-02-05 12:12:59,965 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:59,965 INFO  L471      AbstractCegarLoop]: Abstraction has 31744 states and 33245 transitions.
[2025-02-05 12:12:59,966 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 12:12:59,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 31744 states and 33245 transitions.
[2025-02-05 12:12:59,996 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 764
[2025-02-05 12:12:59,996 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:59,997 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:12:59,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 12:12:59,997 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:00,001 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:00,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862213101, now seen corresponding path program 1 times
[2025-02-05 12:13:00,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:00,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7433654]
[2025-02-05 12:13:00,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:00,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:00,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 763 statements into 1 equivalence classes.
[2025-02-05 12:13:00,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 763 of 763 statements.
[2025-02-05 12:13:00,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:00,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:00,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 870 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked.
[2025-02-05 12:13:00,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:00,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7433654]
[2025-02-05 12:13:00,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7433654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:00,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:00,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:00,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877382777]
[2025-02-05 12:13:00,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:00,530 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:00,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:00,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:00,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:00,531 INFO  L87              Difference]: Start difference. First operand 31744 states and 33245 transitions. Second operand  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 12:13:02,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:02,005 INFO  L93              Difference]: Finished difference Result 75216 states and 79130 transitions.
[2025-02-05 12:13:02,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:13:02,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 763
[2025-02-05 12:13:02,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:02,147 INFO  L225             Difference]: With dead ends: 75216
[2025-02-05 12:13:02,148 INFO  L226             Difference]: Without dead ends: 43474
[2025-02-05 12:13:02,160 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:02,162 INFO  L435           NwaCegarLoop]: 970 mSDtfsCounter, 453 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:02,162 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 976 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:13:02,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43474 states.
[2025-02-05 12:13:02,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43474 to 43474.
[2025-02-05 12:13:02,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43474 states, 43473 states have (on average 1.0436362799898788) internal successors, (45370), 43473 states have internal predecessors, (45370), 0 states have call successors, (0), 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 12:13:02,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43474 states to 43474 states and 45370 transitions.
[2025-02-05 12:13:02,435 INFO  L78                 Accepts]: Start accepts. Automaton has 43474 states and 45370 transitions. Word has length 763
[2025-02-05 12:13:02,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:02,436 INFO  L471      AbstractCegarLoop]: Abstraction has 43474 states and 45370 transitions.
[2025-02-05 12:13:02,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 12:13:02,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 43474 states and 45370 transitions.
[2025-02-05 12:13:02,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 783
[2025-02-05 12:13:02,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:02,447 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:13:02,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:13:02,447 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:02,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:02,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 57810473, now seen corresponding path program 1 times
[2025-02-05 12:13:02,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:02,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807761362]
[2025-02-05 12:13:02,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:02,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:02,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes.
[2025-02-05 12:13:02,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements.
[2025-02-05 12:13:02,502 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:02,502 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:02,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 909 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked.
[2025-02-05 12:13:02,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:02,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807761362]
[2025-02-05 12:13:02,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807761362] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:02,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:02,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:02,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928458949]
[2025-02-05 12:13:02,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:02,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:02,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:02,799 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:02,799 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:02,799 INFO  L87              Difference]: Start difference. First operand 43474 states and 45370 transitions. Second operand  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 12:13:04,278 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:04,279 INFO  L93              Difference]: Finished difference Result 96606 states and 101240 transitions.
[2025-02-05 12:13:04,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:13:04,279 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 782
[2025-02-05 12:13:04,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:04,324 INFO  L225             Difference]: With dead ends: 96606
[2025-02-05 12:13:04,324 INFO  L226             Difference]: Without dead ends: 53134
[2025-02-05 12:13:04,351 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 12:13:04,354 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 454 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:04,354 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 274 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:13:04,386 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53134 states.
[2025-02-05 12:13:04,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 51754.
[2025-02-05 12:13:04,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51754 states, 51753 states have (on average 1.0422584198017506) internal successors, (53940), 51753 states have internal predecessors, (53940), 0 states have call successors, (0), 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 12:13:04,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 53940 transitions.
[2025-02-05 12:13:04,851 INFO  L78                 Accepts]: Start accepts. Automaton has 51754 states and 53940 transitions. Word has length 782
[2025-02-05 12:13:04,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:04,851 INFO  L471      AbstractCegarLoop]: Abstraction has 51754 states and 53940 transitions.
[2025-02-05 12:13:04,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 12:13:04,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 51754 states and 53940 transitions.
[2025-02-05 12:13:04,869 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1308
[2025-02-05 12:13:04,869 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:04,870 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:04,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:13:04,870 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:04,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:04,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 2077148791, now seen corresponding path program 1 times
[2025-02-05 12:13:04,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:04,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095771924]
[2025-02-05 12:13:04,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:04,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:04,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1307 statements into 1 equivalence classes.
[2025-02-05 12:13:05,032 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1307 of 1307 statements.
[2025-02-05 12:13:05,032 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:05,032 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:06,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 1794 backedges. 1253 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked.
[2025-02-05 12:13:06,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:06,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095771924]
[2025-02-05 12:13:06,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095771924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:06,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:06,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:06,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536386811]
[2025-02-05 12:13:06,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:06,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:13:06,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:06,054 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:13:06,054 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:13:06,054 INFO  L87              Difference]: Start difference. First operand 51754 states and 53940 transitions. Second operand  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 12:13:08,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:08,505 INFO  L93              Difference]: Finished difference Result 103506 states and 107892 transitions.
[2025-02-05 12:13:08,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:13:08,506 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 1307
[2025-02-05 12:13:08,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:08,560 INFO  L225             Difference]: With dead ends: 103506
[2025-02-05 12:13:08,560 INFO  L226             Difference]: Without dead ends: 52444
[2025-02-05 12:13:08,592 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 12:13:08,592 INFO  L435           NwaCegarLoop]: 87 mSDtfsCounter, 797 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:08,592 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 98 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:13:08,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52444 states.
[2025-02-05 12:13:08,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52444 to 51754.
[2025-02-05 12:13:09,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51754 states, 51753 states have (on average 1.0420265491855545) internal successors, (53928), 51753 states have internal predecessors, (53928), 0 states have call successors, (0), 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 12:13:09,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 53928 transitions.
[2025-02-05 12:13:09,078 INFO  L78                 Accepts]: Start accepts. Automaton has 51754 states and 53928 transitions. Word has length 1307
[2025-02-05 12:13:09,078 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:09,079 INFO  L471      AbstractCegarLoop]: Abstraction has 51754 states and 53928 transitions.
[2025-02-05 12:13:09,079 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 12:13:09,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 51754 states and 53928 transitions.
[2025-02-05 12:13:09,096 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1387
[2025-02-05 12:13:09,096 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:09,096 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:09,096 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:13:09,097 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:09,097 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:09,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 1214415610, now seen corresponding path program 1 times
[2025-02-05 12:13:09,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:09,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402191673]
[2025-02-05 12:13:09,097 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:09,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:09,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1386 statements into 1 equivalence classes.
[2025-02-05 12:13:09,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1386 of 1386 statements.
[2025-02-05 12:13:09,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:09,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:09,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 2268 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked.
[2025-02-05 12:13:09,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:09,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402191673]
[2025-02-05 12:13:09,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402191673] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:09,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:09,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:09,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414484534]
[2025-02-05 12:13:09,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:09,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:09,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:09,727 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:09,727 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:09,727 INFO  L87              Difference]: Start difference. First operand 51754 states and 53928 transitions. Second operand  has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 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 12:13:11,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:11,115 INFO  L93              Difference]: Finished difference Result 102126 states and 106452 transitions.
[2025-02-05 12:13:11,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:13:11,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 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 1386
[2025-02-05 12:13:11,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:11,172 INFO  L225             Difference]: With dead ends: 102126
[2025-02-05 12:13:11,172 INFO  L226             Difference]: Without dead ends: 51064
[2025-02-05 12:13:11,184 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 12:13:11,186 INFO  L435           NwaCegarLoop]: 880 mSDtfsCounter, 705 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:11,186 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 887 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 12:13:11,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51064 states.
[2025-02-05 12:13:11,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51064 to 48304.
[2025-02-05 12:13:11,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48304 states, 48303 states have (on average 1.0287766805374408) internal successors, (49693), 48303 states have internal predecessors, (49693), 0 states have call successors, (0), 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 12:13:11,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 49693 transitions.
[2025-02-05 12:13:11,557 INFO  L78                 Accepts]: Start accepts. Automaton has 48304 states and 49693 transitions. Word has length 1386
[2025-02-05 12:13:11,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:11,558 INFO  L471      AbstractCegarLoop]: Abstraction has 48304 states and 49693 transitions.
[2025-02-05 12:13:11,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 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 12:13:11,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 48304 states and 49693 transitions.
[2025-02-05 12:13:11,579 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1471
[2025-02-05 12:13:11,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:11,580 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:11,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:13:11,580 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:11,580 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:11,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -361870527, now seen corresponding path program 1 times
[2025-02-05 12:13:11,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:11,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361285666]
[2025-02-05 12:13:11,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:11,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:11,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1470 statements into 1 equivalence classes.
[2025-02-05 12:13:11,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1470 of 1470 statements.
[2025-02-05 12:13:11,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:11,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:14,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 2823 backedges. 866 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked.
[2025-02-05 12:13:14,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:14,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361285666]
[2025-02-05 12:13:14,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361285666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:14,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:14,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:14,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145576957]
[2025-02-05 12:13:14,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:14,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:14,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:14,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:14,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:14,985 INFO  L87              Difference]: Start difference. First operand 48304 states and 49693 transitions. Second operand  has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 12:13:16,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:16,347 INFO  L93              Difference]: Finished difference Result 95916 states and 98689 transitions.
[2025-02-05 12:13:16,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:13:16,347 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 1470
[2025-02-05 12:13:16,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:16,399 INFO  L225             Difference]: With dead ends: 95916
[2025-02-05 12:13:16,399 INFO  L226             Difference]: Without dead ends: 47614
[2025-02-05 12:13:16,426 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 12:13:16,427 INFO  L435           NwaCegarLoop]: 752 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:16,427 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 758 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:13:16,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47614 states.
[2025-02-05 12:13:16,710 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 47614.
[2025-02-05 12:13:16,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47614 states, 47613 states have (on average 1.0245311154516623) internal successors, (48781), 47613 states have internal predecessors, (48781), 0 states have call successors, (0), 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 12:13:16,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47614 states to 47614 states and 48781 transitions.
[2025-02-05 12:13:16,784 INFO  L78                 Accepts]: Start accepts. Automaton has 47614 states and 48781 transitions. Word has length 1470
[2025-02-05 12:13:16,785 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:16,785 INFO  L471      AbstractCegarLoop]: Abstraction has 47614 states and 48781 transitions.
[2025-02-05 12:13:16,785 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 12:13:16,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 47614 states and 48781 transitions.
[2025-02-05 12:13:16,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1510
[2025-02-05 12:13:16,810 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:16,811 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:16,811 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 12:13:16,811 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:16,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:16,812 INFO  L85        PathProgramCache]: Analyzing trace with hash 682268464, now seen corresponding path program 1 times
[2025-02-05 12:13:16,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:16,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144541454]
[2025-02-05 12:13:16,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:16,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:16,977 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1509 statements into 1 equivalence classes.
[2025-02-05 12:13:17,097 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1509 of 1509 statements.
[2025-02-05 12:13:17,101 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:17,101 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:18,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 3380 backedges. 1933 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked.
[2025-02-05 12:13:18,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:18,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144541454]
[2025-02-05 12:13:18,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144541454] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:18,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:18,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:18,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843590666]
[2025-02-05 12:13:18,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:18,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:18,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:18,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:18,454 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:18,454 INFO  L87              Difference]: Start difference. First operand 47614 states and 48781 transitions. Second operand  has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 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 12:13:20,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:20,219 INFO  L93              Difference]: Finished difference Result 116616 states and 119676 transitions.
[2025-02-05 12:13:20,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:13:20,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 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 1509
[2025-02-05 12:13:20,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:20,288 INFO  L225             Difference]: With dead ends: 116616
[2025-02-05 12:13:20,288 INFO  L226             Difference]: Without dead ends: 69004
[2025-02-05 12:13:20,319 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 12:13:20,320 INFO  L435           NwaCegarLoop]: 941 mSDtfsCounter, 607 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:20,320 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 948 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:13:20,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69004 states.
[2025-02-05 12:13:20,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69004 to 68314.
[2025-02-05 12:13:20,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68314 states, 68313 states have (on average 1.019996193989431) internal successors, (69679), 68313 states have internal predecessors, (69679), 0 states have call successors, (0), 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 12:13:20,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68314 states to 68314 states and 69679 transitions.
[2025-02-05 12:13:20,957 INFO  L78                 Accepts]: Start accepts. Automaton has 68314 states and 69679 transitions. Word has length 1509
[2025-02-05 12:13:20,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:20,958 INFO  L471      AbstractCegarLoop]: Abstraction has 68314 states and 69679 transitions.
[2025-02-05 12:13:20,958 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 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 12:13:20,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 68314 states and 69679 transitions.
[2025-02-05 12:13:20,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1666
[2025-02-05 12:13:20,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:20,991 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:20,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 12:13:20,991 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:20,992 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:20,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -180793375, now seen corresponding path program 1 times
[2025-02-05 12:13:20,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:20,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724512835]
[2025-02-05 12:13:20,993 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:20,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:21,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1665 statements into 1 equivalence classes.
[2025-02-05 12:13:21,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1665 of 1665 statements.
[2025-02-05 12:13:21,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:21,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:21,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 3042 backedges. 1406 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked.
[2025-02-05 12:13:21,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:21,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724512835]
[2025-02-05 12:13:21,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724512835] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:21,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:21,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:13:21,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611801355]
[2025-02-05 12:13:21,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:21,968 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:13:21,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:21,968 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:13:21,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:13:21,969 INFO  L87              Difference]: Start difference. First operand 68314 states and 69679 transitions. Second operand  has 4 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 0 states have call successors, (0), 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 12:13:23,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:13:23,563 INFO  L93              Difference]: Finished difference Result 135251 states and 137979 transitions.
[2025-02-05 12:13:23,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:13:23,563 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 0 states have call successors, (0), 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 1665
[2025-02-05 12:13:23,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:13:23,565 INFO  L225             Difference]: With dead ends: 135251
[2025-02-05 12:13:23,567 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 12:13:23,610 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:13:23,610 INFO  L435           NwaCegarLoop]: 922 mSDtfsCounter, 396 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:13:23,611 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 933 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:13:23,611 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 12:13:23,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 12:13:23,611 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 12:13:23,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 12:13:23,612 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1665
[2025-02-05 12:13:23,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:23,612 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 12:13:23,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 0 states have call successors, (0), 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 12:13:23,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 12:13:23,617 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 12:13:23,621 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 12:13:23,621 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 12:13:23,627 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 12:13:23,628 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 12:13:24,689 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 12:13:24,698 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:13:24 BoogieIcfgContainer
[2025-02-05 12:13:24,699 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 12:13:24,699 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 12:13:24,699 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 12:13:24,699 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 12:13:24,700 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:12:29" (3/4) ...
[2025-02-05 12:13:24,701 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 12:13:24,732 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-02-05 12:13:24,735 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 12:13:24,738 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 12:13:24,741 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 12:13:24,894 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 12:13:24,895 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 12:13:24,895 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 12:13:24,895 INFO  L158              Benchmark]: Toolchain (without parser) took 59275.28ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 102.8MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 537.3MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,895 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 12:13:24,898 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 878.21ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 56.6MB in the end (delta: 46.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,898 INFO  L158              Benchmark]: Boogie Procedure Inliner took 178.93ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 70.5MB in the end (delta: -13.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,898 INFO  L158              Benchmark]: Boogie Preprocessor took 216.71ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 54.5MB in the end (delta: 16.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,898 INFO  L158              Benchmark]: IcfgBuilder took 3083.57ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 54.5MB in the beginning and 180.1MB in the end (delta: -125.6MB). Peak memory consumption was 159.2MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,899 INFO  L158              Benchmark]: TraceAbstraction took 54716.20ms. Allocated memory was 285.2MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 180.1MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,899 INFO  L158              Benchmark]: Witness Printer took 195.50ms. Allocated memory is still 3.7GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-02-05 12:13:24,900 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 878.21ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 56.6MB in the end (delta: 46.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 178.93ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 70.5MB in the end (delta: -13.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 216.71ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 54.5MB in the end (delta: 16.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
 * IcfgBuilder took 3083.57ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 54.5MB in the beginning and 180.1MB in the end (delta: -125.6MB). Peak memory consumption was 159.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 54716.20ms. Allocated memory was 285.2MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 180.1MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB.
 * Witness Printer took 195.50ms. Allocated memory is still 3.7GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. 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: 181]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.6s, OverallIterations: 18, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11345 SdHoareTripleChecker+Valid, 30.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11345 mSDsluCounter, 12665 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 5807 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36950 IncrementalHoareTripleChecker+Invalid, 42757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5807 mSolverCounterUnsat, 12519 mSDtfsCounter, 36950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68314occurred in iteration=17, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 10350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 13699 NumberOfCodeBlocks, 13699 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 13680 ConstructedInterpolants, 0 QuantifiedInterpolants, 25142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 18433/18474 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: 4269]: Location Invariant
    Derived location invariant: ((((((((((((((((((3 <= a24) && (5 == a15)) || (((307 <= a3) && (a15 <= 4)) && (a3 <= 417))) || ((a15 <= 4) && (a3 <= 99))) || ((((a18 == 8) && (a3 <= 115)) && (a15 == 4)) && (a24 == 2))) || ((a24 == 0) && (a15 <= 4))) || ((a24 == 0) && (5 == a15))) || ((5 == a15) && (a24 == 2))) || ((a24 == 0) && (a15 == 6))) || ((a24 == 2) && (a15 == 6))) || ((((a15 == 4) && (418 <= a3)) && (a24 == 2)) && (a18 == 11))) || ((a15 <= 4) && (a18 == 10))) || ((a24 == 1) && (a15 == 6))) || ((3 <= a24) && (a15 <= 4))) || ((a24 == 3) && (a15 == 6))) || ((a24 == 1) && (5 == a15))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a18 == 9)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 12:13:24,918 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