./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label59.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/Problem17_label59.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 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:07:06,423 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:07:06,470 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:07:06,474 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:07:06,474 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:07:06,488 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:07:06,489 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:07:06,489 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:07:06,489 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:07:06,489 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:07:06,489 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:07:06,489 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:07:06,489 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:07:06,490 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:07:06,490 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:07:06,491 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:07:06,491 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:07:06,492 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:07:06,492 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:07:06,492 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 -> 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21
[2025-02-05 12:07:06,714 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:07:06,719 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:07:06,721 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:07:06,721 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:07:06,722 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:07:06,722 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label59.c
[2025-02-05 12:07:07,939 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00bd82a8c/98ec2a2cb4c2451d848689f4a76bfe06/FLAGb1da7eea6
[2025-02-05 12:07:08,420 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:07:08,421 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label59.c
[2025-02-05 12:07:08,455 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00bd82a8c/98ec2a2cb4c2451d848689f4a76bfe06/FLAGb1da7eea6
[2025-02-05 12:07:08,480 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00bd82a8c/98ec2a2cb4c2451d848689f4a76bfe06
[2025-02-05 12:07:08,486 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:07:08,487 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:07:08,492 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:07:08,492 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:07:08,496 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:07:08,498 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:07:08" (1/1) ...
[2025-02-05 12:07:08,501 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5c920f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:08, skipping insertion in model container
[2025-02-05 12:07:08,502 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:07:08" (1/1) ...
[2025-02-05 12:07:08,614 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:07:08,936 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/Problem17_label59.c[4894,4907]
[2025-02-05 12:07:09,814 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:07:09,831 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:07:09,864 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/Problem17_label59.c[4894,4907]
[2025-02-05 12:07:10,307 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:07:10,321 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:07:10,322 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10 WrapperNode
[2025-02-05 12:07:10,323 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:07:10,324 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:07:10,324 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:07:10,324 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:07:10,329 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:07:10" (1/1) ...
[2025-02-05 12:07:10,366 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:07:10" (1/1) ...
[2025-02-05 12:07:10,527 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-02-05 12:07:10,528 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:07:10,528 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:07:10,528 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:07:10,528 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:07:10,536 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,536 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,681 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,788 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:07:10,791 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,791 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,865 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,882 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,901 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,914 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,948 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:07:10,949 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:07:10,950 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:07:10,950 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:07:10,951 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (1/1) ...
[2025-02-05 12:07:10,955 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:07:10,965 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:07:10,980 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:07:10,984 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:07:11,002 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:07:11,003 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:07:11,003 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:07:11,003 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:07:11,055 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:07:11,056 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:07:13,869 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-02-05 12:07:13,981 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-02-05 12:07:13,981 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:07:14,074 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:07:14,074 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:07:14,075 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:07:14 BoogieIcfgContainer
[2025-02-05 12:07:14,075 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:07:14,079 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:07:14,079 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:07:14,083 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:07:14,083 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:07:08" (1/3) ...
[2025-02-05 12:07:14,084 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7bc263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:07:14, skipping insertion in model container
[2025-02-05 12:07:14,084 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:10" (2/3) ...
[2025-02-05 12:07:14,084 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7bc263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:07:14, skipping insertion in model container
[2025-02-05 12:07:14,084 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:07:14" (3/3) ...
[2025-02-05 12:07:14,085 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label59.c
[2025-02-05 12:07:14,099 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:07:14,100 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label59.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:07:14,163 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:07:14,174 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;@7f0c3ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:07:14,175 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:07:14,179 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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:07:14,186 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-02-05 12:07:14,187 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:14,187 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]
[2025-02-05 12:07:14,188 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:14,191 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:14,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 1329171671, now seen corresponding path program 1 times
[2025-02-05 12:07:14,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:14,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987599578]
[2025-02-05 12:07:14,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:14,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:14,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-05 12:07:14,292 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-05 12:07:14,293 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:14,293 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:14,471 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:07:14,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:14,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987599578]
[2025-02-05 12:07:14,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987599578] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:14,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:14,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:07:14,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354413189]
[2025-02-05 12:07:14,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:14,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:14,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:14,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:14,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:14,516 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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:07:16,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:16,738 INFO  L93              Difference]: Finished difference Result 1680 states and 3071 transitions.
[2025-02-05 12:07:16,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:16,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32
[2025-02-05 12:07:16,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:16,755 INFO  L225             Difference]: With dead ends: 1680
[2025-02-05 12:07:16,755 INFO  L226             Difference]: Without dead ends: 1011
[2025-02-05 12:07:16,759 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:07:16,761 INFO  L435           NwaCegarLoop]: 167 mSDtfsCounter, 549 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:16,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:07:16,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1011 states.
[2025-02-05 12:07:16,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996.
[2025-02-05 12:07:16,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 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:07:16,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions.
[2025-02-05 12:07:16,817 INFO  L78                 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 32
[2025-02-05 12:07:16,817 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:16,817 INFO  L471      AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions.
[2025-02-05 12:07:16,818 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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:07:16,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions.
[2025-02-05 12:07:16,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2025-02-05 12:07:16,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:16,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:16,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:07:16,824 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:16,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:16,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 263392702, now seen corresponding path program 1 times
[2025-02-05 12:07:16,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:16,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559702014]
[2025-02-05 12:07:16,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:16,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:16,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-02-05 12:07:16,865 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-02-05 12:07:16,865 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:16,865 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:17,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:17,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:17,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559702014]
[2025-02-05 12:07:17,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559702014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:17,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:17,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:07:17,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052661270]
[2025-02-05 12:07:17,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:17,023 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:17,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:17,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:17,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:17,024 INFO  L87              Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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:07:18,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:18,782 INFO  L93              Difference]: Finished difference Result 2848 states and 4983 transitions.
[2025-02-05 12:07:18,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:18,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2025-02-05 12:07:18,783 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:18,789 INFO  L225             Difference]: With dead ends: 2848
[2025-02-05 12:07:18,789 INFO  L226             Difference]: Without dead ends: 1854
[2025-02-05 12:07:18,790 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:07:18,791 INFO  L435           NwaCegarLoop]: 514 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:18,791 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:07:18,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1854 states.
[2025-02-05 12:07:18,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854.
[2025-02-05 12:07:18,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1854 states, 1853 states have (on average 1.4020507285483002) internal successors, (2598), 1853 states have internal predecessors, (2598), 0 states have call successors, (0), 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:07:18,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2598 transitions.
[2025-02-05 12:07:18,835 INFO  L78                 Accepts]: Start accepts. Automaton has 1854 states and 2598 transitions. Word has length 97
[2025-02-05 12:07:18,835 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:18,835 INFO  L471      AbstractCegarLoop]: Abstraction has 1854 states and 2598 transitions.
[2025-02-05 12:07:18,835 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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:07:18,835 INFO  L276                IsEmpty]: Start isEmpty. Operand 1854 states and 2598 transitions.
[2025-02-05 12:07:18,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-02-05 12:07:18,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:18,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,837 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:07:18,838 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:18,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:18,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1222058751, now seen corresponding path program 1 times
[2025-02-05 12:07:18,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:18,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661713645]
[2025-02-05 12:07:18,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:18,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:18,850 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-02-05 12:07:18,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-02-05 12:07:18,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:18,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:19,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:19,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:19,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661713645]
[2025-02-05 12:07:19,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661713645] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:19,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:19,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:19,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436740308]
[2025-02-05 12:07:19,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:19,004 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:19,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:19,005 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:19,005 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:19,005 INFO  L87              Difference]: Start difference. First operand 1854 states and 2598 transitions. Second operand  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:07:20,766 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:20,766 INFO  L93              Difference]: Finished difference Result 5418 states and 7597 transitions.
[2025-02-05 12:07:20,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:20,767 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102
[2025-02-05 12:07:20,768 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:20,778 INFO  L225             Difference]: With dead ends: 5418
[2025-02-05 12:07:20,779 INFO  L226             Difference]: Without dead ends: 2713
[2025-02-05 12:07:20,786 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:07:20,787 INFO  L435           NwaCegarLoop]: 806 mSDtfsCounter, 475 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:20,788 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 874 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:07:20,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2713 states.
[2025-02-05 12:07:20,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2710.
[2025-02-05 12:07:20,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2710 states, 2709 states have (on average 1.2694721299372462) internal successors, (3439), 2709 states have internal predecessors, (3439), 0 states have call successors, (0), 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:07:20,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3439 transitions.
[2025-02-05 12:07:20,846 INFO  L78                 Accepts]: Start accepts. Automaton has 2710 states and 3439 transitions. Word has length 102
[2025-02-05 12:07:20,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:20,847 INFO  L471      AbstractCegarLoop]: Abstraction has 2710 states and 3439 transitions.
[2025-02-05 12:07:20,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:07:20,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 2710 states and 3439 transitions.
[2025-02-05 12:07:20,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2025-02-05 12:07:20,857 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:20,857 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:07:20,857 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:07:20,857 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:20,858 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:20,859 INFO  L85        PathProgramCache]: Analyzing trace with hash -617744196, now seen corresponding path program 1 times
[2025-02-05 12:07:20,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:20,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035267235]
[2025-02-05 12:07:20,859 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:20,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:20,889 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes.
[2025-02-05 12:07:20,923 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements.
[2025-02-05 12:07:20,923 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:20,923 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:21,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:21,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:21,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035267235]
[2025-02-05 12:07:21,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035267235] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:21,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:21,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:21,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591122420]
[2025-02-05 12:07:21,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:21,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:21,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:21,173 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:21,173 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:21,173 INFO  L87              Difference]: Start difference. First operand 2710 states and 3439 transitions. Second operand  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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:07:22,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:22,641 INFO  L93              Difference]: Finished difference Result 7123 states and 9245 transitions.
[2025-02-05 12:07:22,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:22,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 184
[2025-02-05 12:07:22,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:22,654 INFO  L225             Difference]: With dead ends: 7123
[2025-02-05 12:07:22,655 INFO  L226             Difference]: Without dead ends: 4415
[2025-02-05 12:07:22,658 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:07:22,659 INFO  L435           NwaCegarLoop]: 728 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:22,659 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 786 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:07:22,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4415 states.
[2025-02-05 12:07:22,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4415.
[2025-02-05 12:07:22,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4415 states, 4414 states have (on average 1.2417308563661078) internal successors, (5481), 4414 states have internal predecessors, (5481), 0 states have call successors, (0), 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:07:22,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 5481 transitions.
[2025-02-05 12:07:22,725 INFO  L78                 Accepts]: Start accepts. Automaton has 4415 states and 5481 transitions. Word has length 184
[2025-02-05 12:07:22,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:22,725 INFO  L471      AbstractCegarLoop]: Abstraction has 4415 states and 5481 transitions.
[2025-02-05 12:07:22,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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:07:22,726 INFO  L276                IsEmpty]: Start isEmpty. Operand 4415 states and 5481 transitions.
[2025-02-05 12:07:22,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2025-02-05 12:07:22,728 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:22,728 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:07:22,728 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:07:22,729 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:22,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:22,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -280996977, now seen corresponding path program 1 times
[2025-02-05 12:07:22,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:22,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166246630]
[2025-02-05 12:07:22,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:22,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:22,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-05 12:07:22,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-05 12:07:22,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:22,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:23,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 300 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked.
[2025-02-05 12:07:23,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:23,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166246630]
[2025-02-05 12:07:23,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166246630] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:23,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:23,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:23,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725847462]
[2025-02-05 12:07:23,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:23,160 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:23,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:23,160 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:23,160 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:23,161 INFO  L87              Difference]: Start difference. First operand 4415 states and 5481 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:07:24,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:24,687 INFO  L93              Difference]: Finished difference Result 12654 states and 15711 transitions.
[2025-02-05 12:07:24,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:24,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261
[2025-02-05 12:07:24,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:24,721 INFO  L225             Difference]: With dead ends: 12654
[2025-02-05 12:07:24,724 INFO  L226             Difference]: Without dead ends: 7391
[2025-02-05 12:07:24,733 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:07:24,734 INFO  L435           NwaCegarLoop]: 806 mSDtfsCounter, 416 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:24,734 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 876 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:07:24,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7391 states.
[2025-02-05 12:07:24,914 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 7391.
[2025-02-05 12:07:24,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7391 states, 7390 states have (on average 1.1667117726657645) internal successors, (8622), 7390 states have internal predecessors, (8622), 0 states have call successors, (0), 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:07:24,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 8622 transitions.
[2025-02-05 12:07:24,958 INFO  L78                 Accepts]: Start accepts. Automaton has 7391 states and 8622 transitions. Word has length 261
[2025-02-05 12:07:24,959 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:24,959 INFO  L471      AbstractCegarLoop]: Abstraction has 7391 states and 8622 transitions.
[2025-02-05 12:07:24,959 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:07:24,959 INFO  L276                IsEmpty]: Start isEmpty. Operand 7391 states and 8622 transitions.
[2025-02-05 12:07:24,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 279
[2025-02-05 12:07:24,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:24,966 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:07:24,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 12:07:24,966 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:24,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:24,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 1130725699, now seen corresponding path program 1 times
[2025-02-05 12:07:24,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:24,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365282470]
[2025-02-05 12:07:24,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:24,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:25,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes.
[2025-02-05 12:07:25,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements.
[2025-02-05 12:07:25,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:25,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:25,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 328 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked.
[2025-02-05 12:07:25,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:25,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365282470]
[2025-02-05 12:07:25,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365282470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:25,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:25,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:25,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082481485]
[2025-02-05 12:07:25,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:25,263 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:25,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:25,264 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:25,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:25,264 INFO  L87              Difference]: Start difference. First operand 7391 states and 8622 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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:07:26,882 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:26,882 INFO  L93              Difference]: Finished difference Result 18609 states and 21941 transitions.
[2025-02-05 12:07:26,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:26,883 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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 278
[2025-02-05 12:07:26,883 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:26,907 INFO  L225             Difference]: With dead ends: 18609
[2025-02-05 12:07:26,908 INFO  L226             Difference]: Without dead ends: 10346
[2025-02-05 12:07:26,916 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:07:26,916 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 483 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:26,917 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 736 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:07:26,926 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10346 states.
[2025-02-05 12:07:27,034 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 10344.
[2025-02-05 12:07:27,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10344 states, 10343 states have (on average 1.1618485932514744) internal successors, (12017), 10343 states have internal predecessors, (12017), 0 states have call successors, (0), 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:07:27,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10344 states to 10344 states and 12017 transitions.
[2025-02-05 12:07:27,069 INFO  L78                 Accepts]: Start accepts. Automaton has 10344 states and 12017 transitions. Word has length 278
[2025-02-05 12:07:27,069 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:27,069 INFO  L471      AbstractCegarLoop]: Abstraction has 10344 states and 12017 transitions.
[2025-02-05 12:07:27,069 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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:07:27,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 10344 states and 12017 transitions.
[2025-02-05 12:07:27,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 372
[2025-02-05 12:07:27,076 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:27,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,076 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:07:27,076 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:27,077 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:27,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059777436, now seen corresponding path program 1 times
[2025-02-05 12:07:27,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:27,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954724567]
[2025-02-05 12:07:27,077 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:27,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:27,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes.
[2025-02-05 12:07:27,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements.
[2025-02-05 12:07:27,215 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:27,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:27,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:27,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:27,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954724567]
[2025-02-05 12:07:27,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954724567] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:27,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:27,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:27,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763021539]
[2025-02-05 12:07:27,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:27,743 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:07:27,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:27,744 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:07:27,744 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:07:27,744 INFO  L87              Difference]: Start difference. First operand 10344 states and 12017 transitions. Second operand  has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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:07:29,870 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:29,870 INFO  L93              Difference]: Finished difference Result 24553 states and 28510 transitions.
[2025-02-05 12:07:29,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:07:29,871 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 371
[2025-02-05 12:07:29,872 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:29,910 INFO  L225             Difference]: With dead ends: 24553
[2025-02-05 12:07:29,910 INFO  L226             Difference]: Without dead ends: 13786
[2025-02-05 12:07:29,927 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:07:29,931 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 611 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:29,935 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 259 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:07:29,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13786 states.
[2025-02-05 12:07:30,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13786 to 13781.
[2025-02-05 12:07:30,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13781 states, 13780 states have (on average 1.165312046444122) internal successors, (16058), 13780 states have internal predecessors, (16058), 0 states have call successors, (0), 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:07:30,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 16058 transitions.
[2025-02-05 12:07:30,282 INFO  L78                 Accepts]: Start accepts. Automaton has 13781 states and 16058 transitions. Word has length 371
[2025-02-05 12:07:30,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:30,283 INFO  L471      AbstractCegarLoop]: Abstraction has 13781 states and 16058 transitions.
[2025-02-05 12:07:30,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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:07:30,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 13781 states and 16058 transitions.
[2025-02-05 12:07:30,292 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 400
[2025-02-05 12:07:30,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:30,293 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:07:30,293 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:07:30,294 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:30,294 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:30,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -865507624, now seen corresponding path program 1 times
[2025-02-05 12:07:30,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:30,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107471831]
[2025-02-05 12:07:30,295 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:30,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:30,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-02-05 12:07:30,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-02-05 12:07:30,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:30,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:31,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:31,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:31,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107471831]
[2025-02-05 12:07:31,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107471831] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:07:31,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420144278]
[2025-02-05 12:07:31,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:31,089 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:07:31,089 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:07:31,094 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:07:31,095 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:07:31,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-02-05 12:07:31,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-02-05 12:07:31,248 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:31,248 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:31,251 INFO  L256         TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:07:31,265 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:07:31,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:31,858 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:07:32,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:32,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [420144278] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:07:32,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:07:32,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2025-02-05 12:07:32,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165264729]
[2025-02-05 12:07:32,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:32,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:07:32,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:32,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:07:32,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:07:32,330 INFO  L87              Difference]: Start difference. First operand 13781 states and 16058 transitions. Second operand  has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:07:35,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:35,230 INFO  L93              Difference]: Finished difference Result 33090 states and 38283 transitions.
[2025-02-05 12:07:35,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:07:35,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 399
[2025-02-05 12:07:35,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:35,297 INFO  L225             Difference]: With dead ends: 33090
[2025-02-05 12:07:35,297 INFO  L226             Difference]: Without dead ends: 18034
[2025-02-05 12:07:35,317 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:07:35,318 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 759 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:35,318 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 136 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 12:07:35,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18034 states.
[2025-02-05 12:07:35,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 14204.
[2025-02-05 12:07:35,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14204 states, 14203 states have (on average 1.160529465605858) internal successors, (16483), 14203 states have internal predecessors, (16483), 0 states have call successors, (0), 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:07:35,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14204 states to 14204 states and 16483 transitions.
[2025-02-05 12:07:35,677 INFO  L78                 Accepts]: Start accepts. Automaton has 14204 states and 16483 transitions. Word has length 399
[2025-02-05 12:07:35,677 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:35,677 INFO  L471      AbstractCegarLoop]: Abstraction has 14204 states and 16483 transitions.
[2025-02-05 12:07:35,677 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:07:35,678 INFO  L276                IsEmpty]: Start isEmpty. Operand 14204 states and 16483 transitions.
[2025-02-05 12:07:35,698 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 474
[2025-02-05 12:07:35,698 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:35,699 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:35,708 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:07:35,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:07:35,900 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:35,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:35,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 977937782, now seen corresponding path program 1 times
[2025-02-05 12:07:35,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:35,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261552121]
[2025-02-05 12:07:35,901 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:35,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:35,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes.
[2025-02-05 12:07:35,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements.
[2025-02-05 12:07:35,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:35,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:36,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 318 backedges. 89 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:07:36,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:36,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261552121]
[2025-02-05 12:07:36,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261552121] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:07:36,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405532005]
[2025-02-05 12:07:36,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:36,778 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:07:36,778 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:07:36,782 INFO  L229       MonitoredProcess]: Starting monitored process 3 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:07:36,783 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 12:07:36,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes.
[2025-02-05 12:07:36,910 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements.
[2025-02-05 12:07:36,910 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:36,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:36,912 INFO  L256         TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:07:36,918 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:07:37,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 318 backedges. 215 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-02-05 12:07:37,064 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:07:37,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 318 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-02-05 12:07:37,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405532005] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:07:37,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:07:37,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6
[2025-02-05 12:07:37,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307966205]
[2025-02-05 12:07:37,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:37,259 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:07:37,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:37,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:07:37,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:07:37,260 INFO  L87              Difference]: Start difference. First operand 14204 states and 16483 transitions. Second operand  has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:07:39,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:39,735 INFO  L93              Difference]: Finished difference Result 35671 states and 41487 transitions.
[2025-02-05 12:07:39,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:07:39,736 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473
[2025-02-05 12:07:39,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:39,769 INFO  L225             Difference]: With dead ends: 35671
[2025-02-05 12:07:39,769 INFO  L226             Difference]: Without dead ends: 21894
[2025-02-05 12:07:39,782 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:07:39,783 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 884 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:39,783 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 167 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:07:39,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21894 states.
[2025-02-05 12:07:39,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 20187.
[2025-02-05 12:07:40,007 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20187 states, 20186 states have (on average 1.164519964331715) internal successors, (23507), 20186 states have internal predecessors, (23507), 0 states have call successors, (0), 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:07:40,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20187 states to 20187 states and 23507 transitions.
[2025-02-05 12:07:40,029 INFO  L78                 Accepts]: Start accepts. Automaton has 20187 states and 23507 transitions. Word has length 473
[2025-02-05 12:07:40,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:40,029 INFO  L471      AbstractCegarLoop]: Abstraction has 20187 states and 23507 transitions.
[2025-02-05 12:07:40,030 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:07:40,030 INFO  L276                IsEmpty]: Start isEmpty. Operand 20187 states and 23507 transitions.
[2025-02-05 12:07:40,119 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 530
[2025-02-05 12:07:40,119 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:40,119 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, 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, 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]
[2025-02-05 12:07:40,135 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-05 12:07:40,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:07:40,324 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:40,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:40,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1172967376, now seen corresponding path program 1 times
[2025-02-05 12:07:40,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:40,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742628938]
[2025-02-05 12:07:40,325 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:40,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:40,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes.
[2025-02-05 12:07:40,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements.
[2025-02-05 12:07:40,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:40,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:40,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 621 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked.
[2025-02-05 12:07:40,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:40,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742628938]
[2025-02-05 12:07:40,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742628938] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:40,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:40,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:40,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540368362]
[2025-02-05 12:07:40,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:40,562 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:40,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:40,563 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:40,563 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:40,563 INFO  L87              Difference]: Start difference. First operand 20187 states and 23507 transitions. Second operand  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:07:42,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:42,092 INFO  L93              Difference]: Finished difference Result 47604 states and 55424 transitions.
[2025-02-05 12:07:42,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:42,093 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 529
[2025-02-05 12:07:42,093 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:42,125 INFO  L225             Difference]: With dead ends: 47604
[2025-02-05 12:07:42,125 INFO  L226             Difference]: Without dead ends: 25284
[2025-02-05 12:07:42,136 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:07:42,137 INFO  L435           NwaCegarLoop]: 670 mSDtfsCounter, 492 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:42,137 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 718 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:07:42,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25284 states.
[2025-02-05 12:07:42,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25284 to 25278.
[2025-02-05 12:07:42,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25278 states, 25277 states have (on average 1.140799936701349) internal successors, (28836), 25277 states have internal predecessors, (28836), 0 states have call successors, (0), 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:07:42,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25278 states to 25278 states and 28836 transitions.
[2025-02-05 12:07:42,380 INFO  L78                 Accepts]: Start accepts. Automaton has 25278 states and 28836 transitions. Word has length 529
[2025-02-05 12:07:42,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:42,381 INFO  L471      AbstractCegarLoop]: Abstraction has 25278 states and 28836 transitions.
[2025-02-05 12:07:42,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:07:42,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 25278 states and 28836 transitions.
[2025-02-05 12:07:42,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 580
[2025-02-05 12:07:42,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:42,394 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, 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, 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]
[2025-02-05 12:07:42,394 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:07:42,394 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:42,395 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:42,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817586375, now seen corresponding path program 1 times
[2025-02-05 12:07:42,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:42,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164054495]
[2025-02-05 12:07:42,395 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:42,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:42,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes.
[2025-02-05 12:07:42,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements.
[2025-02-05 12:07:42,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:42,472 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:42,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 626 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-02-05 12:07:42,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:42,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164054495]
[2025-02-05 12:07:42,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164054495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:42,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:42,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:42,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780445162]
[2025-02-05 12:07:42,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:42,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:42,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:42,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:42,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:42,801 INFO  L87              Difference]: Start difference. First operand 25278 states and 28836 transitions. Second operand  has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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:07:44,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:44,630 INFO  L93              Difference]: Finished difference Result 59509 states and 68275 transitions.
[2025-02-05 12:07:44,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:44,630 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 579
[2025-02-05 12:07:44,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:44,665 INFO  L225             Difference]: With dead ends: 59509
[2025-02-05 12:07:44,665 INFO  L226             Difference]: Without dead ends: 32101
[2025-02-05 12:07:44,680 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:07:44,681 INFO  L435           NwaCegarLoop]: 602 mSDtfsCounter, 426 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:44,681 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 641 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:07:44,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32101 states.
[2025-02-05 12:07:44,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32101 to 32097.
[2025-02-05 12:07:44,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32097 states, 32096 states have (on average 1.1451271186440677) internal successors, (36754), 32096 states have internal predecessors, (36754), 0 states have call successors, (0), 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:07:44,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32097 states to 32097 states and 36754 transitions.
[2025-02-05 12:07:44,981 INFO  L78                 Accepts]: Start accepts. Automaton has 32097 states and 36754 transitions. Word has length 579
[2025-02-05 12:07:44,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:44,981 INFO  L471      AbstractCegarLoop]: Abstraction has 32097 states and 36754 transitions.
[2025-02-05 12:07:44,982 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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:07:44,982 INFO  L276                IsEmpty]: Start isEmpty. Operand 32097 states and 36754 transitions.
[2025-02-05 12:07:45,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 659
[2025-02-05 12:07:45,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:45,105 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:45,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 12:07:45,105 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:45,106 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:45,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1634364397, now seen corresponding path program 1 times
[2025-02-05 12:07:45,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:45,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265050443]
[2025-02-05 12:07:45,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:45,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:45,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes.
[2025-02-05 12:07:45,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements.
[2025-02-05 12:07:45,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:45,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:45,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 1079 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked.
[2025-02-05 12:07:45,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:45,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265050443]
[2025-02-05 12:07:45,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265050443] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:45,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:45,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:45,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767229488]
[2025-02-05 12:07:45,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:45,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:45,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:45,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:45,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:45,330 INFO  L87              Difference]: Start difference. First operand 32097 states and 36754 transitions. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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:07:47,049 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:47,049 INFO  L93              Difference]: Finished difference Result 77826 states and 89364 transitions.
[2025-02-05 12:07:47,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:47,050 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 658
[2025-02-05 12:07:47,050 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:47,102 INFO  L225             Difference]: With dead ends: 77826
[2025-02-05 12:07:47,103 INFO  L226             Difference]: Without dead ends: 46156
[2025-02-05 12:07:47,130 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:07:47,130 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 487 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:47,131 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 292 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:07:47,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46156 states.
[2025-02-05 12:07:48,063 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46156 to 46134.
[2025-02-05 12:07:48,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46134 states, 46133 states have (on average 1.1360197689289662) internal successors, (52408), 46133 states have internal predecessors, (52408), 0 states have call successors, (0), 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:07:48,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46134 states to 46134 states and 52408 transitions.
[2025-02-05 12:07:48,143 INFO  L78                 Accepts]: Start accepts. Automaton has 46134 states and 52408 transitions. Word has length 658
[2025-02-05 12:07:48,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:48,144 INFO  L471      AbstractCegarLoop]: Abstraction has 46134 states and 52408 transitions.
[2025-02-05 12:07:48,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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:07:48,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 46134 states and 52408 transitions.
[2025-02-05 12:07:48,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 716
[2025-02-05 12:07:48,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:48,167 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:07:48,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:07:48,168 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:48,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:48,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -536435880, now seen corresponding path program 1 times
[2025-02-05 12:07:48,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:48,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059800735]
[2025-02-05 12:07:48,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:48,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:48,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes.
[2025-02-05 12:07:48,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements.
[2025-02-05 12:07:48,243 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:48,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:48,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 1048 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2025-02-05 12:07:48,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:48,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059800735]
[2025-02-05 12:07:48,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059800735] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:48,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:48,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:07:48,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131274515]
[2025-02-05 12:07:48,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:48,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:07:48,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:48,638 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:07:48,638 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:07:48,638 INFO  L87              Difference]: Start difference. First operand 46134 states and 52408 transitions. Second operand  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:07:50,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:50,310 INFO  L93              Difference]: Finished difference Result 110990 states and 125961 transitions.
[2025-02-05 12:07:50,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:07:50,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 715
[2025-02-05 12:07:50,310 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:50,383 INFO  L225             Difference]: With dead ends: 110990
[2025-02-05 12:07:50,384 INFO  L226             Difference]: Without dead ends: 65283
[2025-02-05 12:07:50,410 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:07:50,411 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 392 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:50,411 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 262 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:07:50,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65283 states.
[2025-02-05 12:07:51,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65283 to 62722.
[2025-02-05 12:07:51,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62722 states, 62721 states have (on average 1.121617958897339) internal successors, (70349), 62721 states have internal predecessors, (70349), 0 states have call successors, (0), 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:07:51,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62722 states to 62722 states and 70349 transitions.
[2025-02-05 12:07:51,773 INFO  L78                 Accepts]: Start accepts. Automaton has 62722 states and 70349 transitions. Word has length 715
[2025-02-05 12:07:51,773 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:51,773 INFO  L471      AbstractCegarLoop]: Abstraction has 62722 states and 70349 transitions.
[2025-02-05 12:07:51,773 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:07:51,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 62722 states and 70349 transitions.
[2025-02-05 12:07:51,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 738
[2025-02-05 12:07:51,807 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:51,811 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:07:51,812 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:51,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:51,816 INFO  L85        PathProgramCache]: Analyzing trace with hash 415251109, now seen corresponding path program 1 times
[2025-02-05 12:07:51,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:51,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98632398]
[2025-02-05 12:07:51,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:51,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:51,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes.
[2025-02-05 12:07:51,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements.
[2025-02-05 12:07:51,955 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:51,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:52,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 1075 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked.
[2025-02-05 12:07:52,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:52,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98632398]
[2025-02-05 12:07:52,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98632398] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:52,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:52,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:07:52,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645719991]
[2025-02-05 12:07:52,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:52,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:07:52,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:52,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:07:52,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:07:52,482 INFO  L87              Difference]: Start difference. First operand 62722 states and 70349 transitions. Second operand  has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 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:07:55,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:07:55,043 INFO  L93              Difference]: Finished difference Result 155695 states and 174288 transitions.
[2025-02-05 12:07:55,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:07:55,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 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 737
[2025-02-05 12:07:55,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:07:55,156 INFO  L225             Difference]: With dead ends: 155695
[2025-02-05 12:07:55,157 INFO  L226             Difference]: Without dead ends: 93400
[2025-02-05 12:07:55,209 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:07:55,210 INFO  L435           NwaCegarLoop]: 91 mSDtfsCounter, 774 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:07:55,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 183 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:07:55,281 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93400 states.
[2025-02-05 12:07:56,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93400 to 91691.
[2025-02-05 12:07:56,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91691 states, 91690 states have (on average 1.1132075471698113) internal successors, (102070), 91690 states have internal predecessors, (102070), 0 states have call successors, (0), 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:07:56,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91691 states to 91691 states and 102070 transitions.
[2025-02-05 12:07:56,293 INFO  L78                 Accepts]: Start accepts. Automaton has 91691 states and 102070 transitions. Word has length 737
[2025-02-05 12:07:56,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:07:56,293 INFO  L471      AbstractCegarLoop]: Abstraction has 91691 states and 102070 transitions.
[2025-02-05 12:07:56,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 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:07:56,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 91691 states and 102070 transitions.
[2025-02-05 12:07:56,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 809
[2025-02-05 12:07:56,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:07:56,332 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:56,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:07:56,333 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:07:56,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:07:56,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -388965379, now seen corresponding path program 1 times
[2025-02-05 12:07:56,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:07:56,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837284874]
[2025-02-05 12:07:56,334 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:07:56,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:07:56,381 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes.
[2025-02-05 12:07:56,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements.
[2025-02-05 12:07:56,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:07:56,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:07:57,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 1159 backedges. 847 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-02-05 12:07:57,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:07:57,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837284874]
[2025-02-05 12:07:57,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837284874] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:07:57,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:07:57,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:07:57,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778208489]
[2025-02-05 12:07:57,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:07:57,457 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:07:57,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:07:57,458 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:07:57,458 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:07:57,458 INFO  L87              Difference]: Start difference. First operand 91691 states and 102070 transitions. Second operand  has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 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:08:00,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:00,555 INFO  L93              Difference]: Finished difference Result 192731 states and 213926 transitions.
[2025-02-05 12:08:00,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:08:00,556 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 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 808
[2025-02-05 12:08:00,556 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:00,705 INFO  L225             Difference]: With dead ends: 192731
[2025-02-05 12:08:00,705 INFO  L226             Difference]: Without dead ends: 101465
[2025-02-05 12:08:00,744 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:08:00,744 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 623 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:00,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 367 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:08:00,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101465 states.
[2025-02-05 12:08:01,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101465 to 94654.
[2025-02-05 12:08:01,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94654 states, 94653 states have (on average 1.097619726791544) internal successors, (103893), 94653 states have internal predecessors, (103893), 0 states have call successors, (0), 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:08:01,997 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94654 states to 94654 states and 103893 transitions.
[2025-02-05 12:08:01,998 INFO  L78                 Accepts]: Start accepts. Automaton has 94654 states and 103893 transitions. Word has length 808
[2025-02-05 12:08:01,998 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:01,999 INFO  L471      AbstractCegarLoop]: Abstraction has 94654 states and 103893 transitions.
[2025-02-05 12:08:01,999 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 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:08:01,999 INFO  L276                IsEmpty]: Start isEmpty. Operand 94654 states and 103893 transitions.
[2025-02-05 12:08:02,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 810
[2025-02-05 12:08:02,245 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:02,247 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:08:02,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:08:02,247 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:02,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:02,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928015423, now seen corresponding path program 1 times
[2025-02-05 12:08:02,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:02,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517765810]
[2025-02-05 12:08:02,248 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:02,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:02,316 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes.
[2025-02-05 12:08:02,337 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements.
[2025-02-05 12:08:02,337 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:02,337 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:02,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 1189 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked.
[2025-02-05 12:08:02,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:02,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517765810]
[2025-02-05 12:08:02,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517765810] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:02,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:02,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:08:02,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838500603]
[2025-02-05 12:08:02,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:02,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:08:02,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:02,552 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:08:02,552 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:08:02,552 INFO  L87              Difference]: Start difference. First operand 94654 states and 103893 transitions. Second operand  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:08:04,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:04,428 INFO  L93              Difference]: Finished difference Result 194829 states and 213548 transitions.
[2025-02-05 12:08:04,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:08:04,429 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 809
[2025-02-05 12:08:04,429 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:04,572 INFO  L225             Difference]: With dead ends: 194829
[2025-02-05 12:08:04,572 INFO  L226             Difference]: Without dead ends: 100602
[2025-02-05 12:08:04,635 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:08:04,635 INFO  L435           NwaCegarLoop]: 176 mSDtfsCounter, 505 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:04,636 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 208 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:08:04,717 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100602 states.
[2025-02-05 12:08:05,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100602 to 95492.
[2025-02-05 12:08:05,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95492 states, 95491 states have (on average 1.0874846844205213) internal successors, (103845), 95491 states have internal predecessors, (103845), 0 states have call successors, (0), 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:08:05,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95492 states to 95492 states and 103845 transitions.
[2025-02-05 12:08:05,729 INFO  L78                 Accepts]: Start accepts. Automaton has 95492 states and 103845 transitions. Word has length 809
[2025-02-05 12:08:05,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:05,730 INFO  L471      AbstractCegarLoop]: Abstraction has 95492 states and 103845 transitions.
[2025-02-05 12:08:05,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:08:05,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 95492 states and 103845 transitions.
[2025-02-05 12:08:05,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 829
[2025-02-05 12:08:05,764 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:05,764 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:05,764 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 12:08:05,764 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:05,765 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:05,765 INFO  L85        PathProgramCache]: Analyzing trace with hash 960336200, now seen corresponding path program 1 times
[2025-02-05 12:08:05,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:05,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547655924]
[2025-02-05 12:08:05,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:05,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:05,812 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes.
[2025-02-05 12:08:05,843 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements.
[2025-02-05 12:08:05,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:05,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:06,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 1138 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked.
[2025-02-05 12:08:06,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:06,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547655924]
[2025-02-05 12:08:06,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547655924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:06,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:06,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:08:06,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499021451]
[2025-02-05 12:08:06,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:06,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:08:06,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:06,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:08:06,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:08:06,453 INFO  L87              Difference]: Start difference. First operand 95492 states and 103845 transitions. Second operand  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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:08:09,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:09,326 INFO  L93              Difference]: Finished difference Result 222501 states and 241466 transitions.
[2025-02-05 12:08:09,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:08:09,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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 828
[2025-02-05 12:08:09,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:09,493 INFO  L225             Difference]: With dead ends: 222501
[2025-02-05 12:08:09,494 INFO  L226             Difference]: Without dead ends: 127011
[2025-02-05 12:08:09,572 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:08:09,572 INFO  L435           NwaCegarLoop]: 108 mSDtfsCounter, 469 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:09,573 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 202 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:08:09,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127011 states.
[2025-02-05 12:08:10,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127011 to 119780.
[2025-02-05 12:08:11,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119780 states, 119779 states have (on average 1.0811744963641372) internal successors, (129502), 119779 states have internal predecessors, (129502), 0 states have call successors, (0), 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:08:11,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119780 states to 119780 states and 129502 transitions.
[2025-02-05 12:08:11,131 INFO  L78                 Accepts]: Start accepts. Automaton has 119780 states and 129502 transitions. Word has length 828
[2025-02-05 12:08:11,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:11,132 INFO  L471      AbstractCegarLoop]: Abstraction has 119780 states and 129502 transitions.
[2025-02-05 12:08:11,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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:08:11,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 119780 states and 129502 transitions.
[2025-02-05 12:08:11,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 834
[2025-02-05 12:08:11,179 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:11,179 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:11,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 12:08:11,180 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:11,180 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:11,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1919232176, now seen corresponding path program 1 times
[2025-02-05 12:08:11,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:11,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041377992]
[2025-02-05 12:08:11,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:11,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:11,231 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes.
[2025-02-05 12:08:11,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements.
[2025-02-05 12:08:11,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:11,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:12,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 1158 backedges. 919 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked.
[2025-02-05 12:08:12,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:12,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041377992]
[2025-02-05 12:08:12,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041377992] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:12,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:12,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:08:12,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756579929]
[2025-02-05 12:08:12,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:12,027 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:08:12,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:12,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:08:12,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:08:12,028 INFO  L87              Difference]: Start difference. First operand 119780 states and 129502 transitions. Second operand  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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:08:14,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:14,706 INFO  L93              Difference]: Finished difference Result 265958 states and 287224 transitions.
[2025-02-05 12:08:14,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:08:14,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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 833
[2025-02-05 12:08:14,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:14,909 INFO  L225             Difference]: With dead ends: 265958
[2025-02-05 12:08:14,909 INFO  L226             Difference]: Without dead ends: 146180
[2025-02-05 12:08:14,996 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:08:14,997 INFO  L435           NwaCegarLoop]: 95 mSDtfsCounter, 470 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:14,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 189 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:08:15,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146180 states.
[2025-02-05 12:08:16,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146180 to 120630.
[2025-02-05 12:08:17,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120630 states, 120629 states have (on average 1.0815226852581055) internal successors, (130463), 120629 states have internal predecessors, (130463), 0 states have call successors, (0), 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:08:17,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120630 states to 120630 states and 130463 transitions.
[2025-02-05 12:08:17,200 INFO  L78                 Accepts]: Start accepts. Automaton has 120630 states and 130463 transitions. Word has length 833
[2025-02-05 12:08:17,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:17,200 INFO  L471      AbstractCegarLoop]: Abstraction has 120630 states and 130463 transitions.
[2025-02-05 12:08:17,201 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 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:08:17,202 INFO  L276                IsEmpty]: Start isEmpty. Operand 120630 states and 130463 transitions.
[2025-02-05 12:08:17,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 843
[2025-02-05 12:08:17,250 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:17,250 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,250 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 12:08:17,251 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:17,251 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:17,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 660529050, now seen corresponding path program 1 times
[2025-02-05 12:08:17,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:17,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430046987]
[2025-02-05 12:08:17,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:17,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:17,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes.
[2025-02-05 12:08:17,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements.
[2025-02-05 12:08:17,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:17,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:18,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 1525 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked.
[2025-02-05 12:08:18,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:18,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430046987]
[2025-02-05 12:08:18,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430046987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:18,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:18,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:08:18,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855654259]
[2025-02-05 12:08:18,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:18,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:08:18,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:18,041 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:08:18,041 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:08:18,042 INFO  L87              Difference]: Start difference. First operand 120630 states and 130463 transitions. Second operand  has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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:08:20,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:20,227 INFO  L93              Difference]: Finished difference Result 257498 states and 278201 transitions.
[2025-02-05 12:08:20,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:08:20,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 842
[2025-02-05 12:08:20,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:20,482 INFO  L225             Difference]: With dead ends: 257498
[2025-02-05 12:08:20,482 INFO  L226             Difference]: Without dead ends: 137295
[2025-02-05 12:08:20,551 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:08:20,551 INFO  L435           NwaCegarLoop]: 707 mSDtfsCounter, 327 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:20,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 766 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:08:20,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137295 states.
[2025-02-05 12:08:22,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137295 to 133025.
[2025-02-05 12:08:22,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133025 states, 133024 states have (on average 1.0769635554486408) internal successors, (143262), 133024 states have internal predecessors, (143262), 0 states have call successors, (0), 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:08:22,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133025 states to 133025 states and 143262 transitions.
[2025-02-05 12:08:22,816 INFO  L78                 Accepts]: Start accepts. Automaton has 133025 states and 143262 transitions. Word has length 842
[2025-02-05 12:08:22,818 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:22,818 INFO  L471      AbstractCegarLoop]: Abstraction has 133025 states and 143262 transitions.
[2025-02-05 12:08:22,818 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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:08:22,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 133025 states and 143262 transitions.
[2025-02-05 12:08:22,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 908
[2025-02-05 12:08:22,898 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:22,898 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, 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, 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, 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]
[2025-02-05 12:08:22,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 12:08:22,899 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:22,899 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:22,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 1840801970, now seen corresponding path program 1 times
[2025-02-05 12:08:22,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:22,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908127563]
[2025-02-05 12:08:22,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:22,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:23,035 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes.
[2025-02-05 12:08:23,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements.
[2025-02-05 12:08:23,090 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:23,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:23,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked.
[2025-02-05 12:08:23,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:23,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908127563]
[2025-02-05 12:08:23,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908127563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:23,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:23,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 12:08:23,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749819954]
[2025-02-05 12:08:23,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:23,991 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:08:23,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:23,992 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:08:23,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:08:23,993 INFO  L87              Difference]: Start difference. First operand 133025 states and 143262 transitions. Second operand  has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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:08:27,952 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:08:27,952 INFO  L93              Difference]: Finished difference Result 303956 states and 327051 transitions.
[2025-02-05 12:08:27,953 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 12:08:27,953 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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 907
[2025-02-05 12:08:27,953 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:08:28,180 INFO  L225             Difference]: With dead ends: 303956
[2025-02-05 12:08:28,181 INFO  L226             Difference]: Without dead ends: 171358
[2025-02-05 12:08:28,247 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:08:28,248 INFO  L435           NwaCegarLoop]: 134 mSDtfsCounter, 1069 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:08:28,248 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 237 Invalid, 4148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-02-05 12:08:28,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171358 states.
[2025-02-05 12:08:30,595 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171358 to 157304.
[2025-02-05 12:08:30,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157304 states, 157303 states have (on average 1.0711938106711252) internal successors, (168502), 157303 states have internal predecessors, (168502), 0 states have call successors, (0), 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:08:30,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157304 states to 157304 states and 168502 transitions.
[2025-02-05 12:08:30,915 INFO  L78                 Accepts]: Start accepts. Automaton has 157304 states and 168502 transitions. Word has length 907
[2025-02-05 12:08:30,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:08:30,916 INFO  L471      AbstractCegarLoop]: Abstraction has 157304 states and 168502 transitions.
[2025-02-05 12:08:30,916 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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:08:30,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 157304 states and 168502 transitions.
[2025-02-05 12:08:30,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 908
[2025-02-05 12:08:30,992 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:08:30,993 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, 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, 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, 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]
[2025-02-05 12:08:30,994 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 12:08:30,994 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:08:30,995 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:08:30,995 INFO  L85        PathProgramCache]: Analyzing trace with hash 763700817, now seen corresponding path program 1 times
[2025-02-05 12:08:30,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:08:30,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856523602]
[2025-02-05 12:08:30,995 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:08:30,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:08:31,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes.
[2025-02-05 12:08:31,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements.
[2025-02-05 12:08:31,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:08:31,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:08:31,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked.
[2025-02-05 12:08:31,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:08:31,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856523602]
[2025-02-05 12:08:31,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856523602] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:08:31,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:08:31,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 12:08:31,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775219888]
[2025-02-05 12:08:31,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:08:31,870 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:08:31,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:08:31,870 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:08:31,870 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:08:31,870 INFO  L87              Difference]: Start difference. First operand 157304 states and 168502 transitions. Second operand  has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)