./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label27.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/Problem12_label27.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 a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:37:35,442 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:37:35,517 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:37:35,522 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:37:35,523 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:37:35,540 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:37:35,541 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:37:35,541 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:37:35,542 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:37:35,542 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:37:35,542 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:37:35,542 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:37:35,542 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:37:35,542 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:37:35,542 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:37:35,542 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:37:35,543 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:37:35,543 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:37:35,544 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:37:35,544 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:37:35,544 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 -> a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8
[2025-02-05 11:37:35,821 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:37:35,833 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:37:35,835 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:37:35,838 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:37:35,838 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:37:35,839 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label27.c
[2025-02-05 11:37:37,107 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d572dd9e/bb7b6eb5fec7469385b8d9501d8db6c5/FLAG86d405bdf
[2025-02-05 11:37:37,598 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:37:37,599 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label27.c
[2025-02-05 11:37:37,634 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d572dd9e/bb7b6eb5fec7469385b8d9501d8db6c5/FLAG86d405bdf
[2025-02-05 11:37:37,654 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d572dd9e/bb7b6eb5fec7469385b8d9501d8db6c5
[2025-02-05 11:37:37,656 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:37:37,658 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:37:37,660 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:37:37,661 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:37:37,665 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:37:37,666 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:37:37" (1/1) ...
[2025-02-05 11:37:37,667 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b73984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:37, skipping insertion in model container
[2025-02-05 11:37:37,669 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:37:37" (1/1) ...
[2025-02-05 11:37:37,768 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:37:38,005 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/Problem12_label27.c[4120,4133]
[2025-02-05 11:37:38,616 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:37:38,627 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:37:38,648 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/Problem12_label27.c[4120,4133]
[2025-02-05 11:37:38,978 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:37:39,001 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:37:39,002 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39 WrapperNode
[2025-02-05 11:37:39,002 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:37:39,003 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:37:39,004 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:37:39,004 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:37:39,009 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,070 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,348 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:37:39,349 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:37:39,350 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:37:39,350 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:37:39,350 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:37:39,360 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,362 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,415 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,624 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:37:39,625 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,625 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,804 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,832 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,853 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,867 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,925 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:37:39,927 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:37:39,927 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:37:39,927 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:37:39,929 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (1/1) ...
[2025-02-05 11:37:39,934 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:37:39,947 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:39,963 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:37:39,971 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:37:39,991 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:37:39,991 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:37:39,991 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:37:39,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:37:40,057 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:37:40,059 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:37:44,422 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:37:44,422 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:37:44,423 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:37:44,615 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:37:44,616 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:37:44,650 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:37:44,654 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:37:44,655 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:37:44 BoogieIcfgContainer
[2025-02-05 11:37:44,655 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:37:44,657 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:37:44,657 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:37:44,662 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:37:44,663 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:37:37" (1/3) ...
[2025-02-05 11:37:44,663 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5760c336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:37:44, skipping insertion in model container
[2025-02-05 11:37:44,663 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:39" (2/3) ...
[2025-02-05 11:37:44,664 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5760c336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:37:44, skipping insertion in model container
[2025-02-05 11:37:44,664 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:37:44" (3/3) ...
[2025-02-05 11:37:44,665 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label27.c
[2025-02-05 11:37:44,677 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:37:44,678 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label27.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:37:44,761 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:37:44,771 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;@46b264f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:37:44,773 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:37:44,781 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:44,786 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-02-05 11:37:44,787 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:44,788 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]
[2025-02-05 11:37:44,788 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:44,793 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:44,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455912309, now seen corresponding path program 1 times
[2025-02-05 11:37:44,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:44,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742411096]
[2025-02-05 11:37:44,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:44,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:44,868 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-02-05 11:37:44,903 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-02-05 11:37:44,908 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:44,908 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:45,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:45,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:45,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742411096]
[2025-02-05 11:37:45,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742411096] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:45,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:45,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:37:45,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658593997]
[2025-02-05 11:37:45,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:45,109 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:45,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:45,126 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:45,126 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:45,131 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:48,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:48,625 INFO  L93              Difference]: Finished difference Result 2404 states and 4642 transitions.
[2025-02-05 11:37:48,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:48,627 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31
[2025-02-05 11:37:48,628 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:48,655 INFO  L225             Difference]: With dead ends: 2404
[2025-02-05 11:37:48,655 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:37:48,660 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:48,662 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 789 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:48,663 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-02-05 11:37:48,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:37:48,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:37:48,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:48,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions.
[2025-02-05 11:37:48,768 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 31
[2025-02-05 11:37:48,768 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:48,768 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions.
[2025-02-05 11:37:48,769 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:48,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions.
[2025-02-05 11:37:48,773 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2025-02-05 11:37:48,773 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:48,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:48,774 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:37:48,774 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:48,775 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:48,775 INFO  L85        PathProgramCache]: Analyzing trace with hash -774284046, now seen corresponding path program 1 times
[2025-02-05 11:37:48,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:48,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493747402]
[2025-02-05 11:37:48,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:48,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:48,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-02-05 11:37:48,847 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-02-05 11:37:48,847 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:48,848 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:49,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:49,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:49,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493747402]
[2025-02-05 11:37:49,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493747402] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:49,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:49,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:37:49,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039990548]
[2025-02-05 11:37:49,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:49,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:49,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:49,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:49,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:49,070 INFO  L87              Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:52,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:52,217 INFO  L93              Difference]: Finished difference Result 4514 states and 7250 transitions.
[2025-02-05 11:37:52,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:52,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106
[2025-02-05 11:37:52,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:52,231 INFO  L225             Difference]: With dead ends: 4514
[2025-02-05 11:37:52,231 INFO  L226             Difference]: Without dead ends: 3010
[2025-02-05 11:37:52,234 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:52,236 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:52,236 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-02-05 11:37:52,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-02-05 11:37:52,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-02-05 11:37:52,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:52,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions.
[2025-02-05 11:37:52,304 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 106
[2025-02-05 11:37:52,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:52,304 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions.
[2025-02-05 11:37:52,304 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:52,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions.
[2025-02-05 11:37:52,313 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-02-05 11:37:52,313 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:52,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:52,313 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:37:52,314 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:52,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:52,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -285940786, now seen corresponding path program 1 times
[2025-02-05 11:37:52,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:52,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143171427]
[2025-02-05 11:37:52,314 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:52,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:52,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-02-05 11:37:52,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-02-05 11:37:52,354 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:52,354 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:52,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:52,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:52,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143171427]
[2025-02-05 11:37:52,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143171427] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:52,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:52,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:37:52,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170017170]
[2025-02-05 11:37:52,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:52,552 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:52,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:52,554 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:52,554 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:52,554 INFO  L87              Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:54,957 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:54,958 INFO  L93              Difference]: Finished difference Result 9018 states and 13162 transitions.
[2025-02-05 11:37:54,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:54,958 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135
[2025-02-05 11:37:54,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:54,979 INFO  L225             Difference]: With dead ends: 9018
[2025-02-05 11:37:54,979 INFO  L226             Difference]: Without dead ends: 6012
[2025-02-05 11:37:54,983 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:54,987 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:54,987 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:37:54,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-02-05 11:37:55,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-02-05 11:37:55,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:55,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions.
[2025-02-05 11:37:55,102 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 135
[2025-02-05 11:37:55,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:55,102 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions.
[2025-02-05 11:37:55,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:55,105 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions.
[2025-02-05 11:37:55,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-02-05 11:37:55,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:55,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:55,106 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:37:55,106 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:55,107 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:55,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 728261943, now seen corresponding path program 1 times
[2025-02-05 11:37:55,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:55,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108028917]
[2025-02-05 11:37:55,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:55,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:55,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-02-05 11:37:55,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-02-05 11:37:55,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:55,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:55,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:37:55,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:55,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108028917]
[2025-02-05 11:37:55,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108028917] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:55,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039286324]
[2025-02-05 11:37:55,699 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:55,699 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:55,699 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:55,701 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 11:37:55,704 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 11:37:55,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-02-05 11:37:55,852 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-02-05 11:37:55,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:55,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:55,855 INFO  L256         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:55,862 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:56,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 11:37:56,109 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:56,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039286324] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:56,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:56,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:37:56,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096376159]
[2025-02-05 11:37:56,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:56,111 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:56,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:56,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:56,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:56,112 INFO  L87              Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:58,406 INFO  L93              Difference]: Finished difference Result 15026 states and 18964 transitions.
[2025-02-05 11:37:58,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:58,407 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 172
[2025-02-05 11:37:58,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:58,432 INFO  L225             Difference]: With dead ends: 15026
[2025-02-05 11:37:58,432 INFO  L226             Difference]: Without dead ends: 9016
[2025-02-05 11:37:58,440 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:58,441 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:58,443 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 230 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:37:58,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9016 states.
[2025-02-05 11:37:58,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 8265.
[2025-02-05 11:37:58,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8265 states, 8264 states have (on average 1.2282187802516942) internal successors, (10150), 8264 states have internal predecessors, (10150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 10150 transitions.
[2025-02-05 11:37:58,588 INFO  L78                 Accepts]: Start accepts. Automaton has 8265 states and 10150 transitions. Word has length 172
[2025-02-05 11:37:58,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:58,589 INFO  L471      AbstractCegarLoop]: Abstraction has 8265 states and 10150 transitions.
[2025-02-05 11:37:58,590 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:58,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 8265 states and 10150 transitions.
[2025-02-05 11:37:58,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-02-05 11:37:58,592 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:58,593 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:37:58,601 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 11:37:58,797 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:58,797 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:58,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:58,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1406324092, now seen corresponding path program 1 times
[2025-02-05 11:37:58,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:58,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405726930]
[2025-02-05 11:37:58,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:58,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:58,824 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-02-05 11:37:58,854 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-02-05 11:37:58,854 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:58,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:59,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-02-05 11:37:59,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:59,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405726930]
[2025-02-05 11:37:59,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405726930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:59,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:59,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:59,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411738585]
[2025-02-05 11:37:59,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:59,105 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:59,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:59,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:59,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:59,107 INFO  L87              Difference]: Start difference. First operand 8265 states and 10150 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:02,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:02,235 INFO  L93              Difference]: Finished difference Result 24789 states and 30445 transitions.
[2025-02-05 11:38:02,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:02,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 243
[2025-02-05 11:38:02,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:02,276 INFO  L225             Difference]: With dead ends: 24789
[2025-02-05 11:38:02,277 INFO  L226             Difference]: Without dead ends: 16526
[2025-02-05 11:38:02,283 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:02,284 INFO  L435           NwaCegarLoop]: 1334 mSDtfsCounter, 770 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:02,284 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1342 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-02-05 11:38:02,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16526 states.
[2025-02-05 11:38:02,456 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15775.
[2025-02-05 11:38:02,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15775 states, 15774 states have (on average 1.1633067072397616) internal successors, (18350), 15774 states have internal predecessors, (18350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:02,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 18350 transitions.
[2025-02-05 11:38:02,509 INFO  L78                 Accepts]: Start accepts. Automaton has 15775 states and 18350 transitions. Word has length 243
[2025-02-05 11:38:02,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:02,510 INFO  L471      AbstractCegarLoop]: Abstraction has 15775 states and 18350 transitions.
[2025-02-05 11:38:02,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:02,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 15775 states and 18350 transitions.
[2025-02-05 11:38:02,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-02-05 11:38:02,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:02,513 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:38:02,514 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:38:02,514 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:02,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:02,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -10499652, now seen corresponding path program 1 times
[2025-02-05 11:38:02,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:02,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843272434]
[2025-02-05 11:38:02,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:02,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:02,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-02-05 11:38:02,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-02-05 11:38:02,560 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:02,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:03,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-02-05 11:38:03,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:03,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843272434]
[2025-02-05 11:38:03,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843272434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:03,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:03,310 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:38:03,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161035933]
[2025-02-05 11:38:03,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:03,311 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:38:03,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:03,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:38:03,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:38:03,312 INFO  L87              Difference]: Start difference. First operand 15775 states and 18350 transitions. Second operand  has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:07,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:07,824 INFO  L93              Difference]: Finished difference Result 36805 states and 42435 transitions.
[2025-02-05 11:38:07,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:38:07,825 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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 244
[2025-02-05 11:38:07,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:07,871 INFO  L225             Difference]: With dead ends: 36805
[2025-02-05 11:38:07,872 INFO  L226             Difference]: Without dead ends: 21032
[2025-02-05 11:38:07,889 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:38:07,890 INFO  L435           NwaCegarLoop]: 646 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5277 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 5277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:07,890 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 672 Invalid, 5437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 5277 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time]
[2025-02-05 11:38:07,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21032 states.
[2025-02-05 11:38:08,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 19530.
[2025-02-05 11:38:08,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19530 states, 19529 states have (on average 1.1432741051769164) internal successors, (22327), 19529 states have internal predecessors, (22327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:08,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 22327 transitions.
[2025-02-05 11:38:08,195 INFO  L78                 Accepts]: Start accepts. Automaton has 19530 states and 22327 transitions. Word has length 244
[2025-02-05 11:38:08,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:08,195 INFO  L471      AbstractCegarLoop]: Abstraction has 19530 states and 22327 transitions.
[2025-02-05 11:38:08,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:08,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 19530 states and 22327 transitions.
[2025-02-05 11:38:08,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 316
[2025-02-05 11:38:08,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:08,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:08,200 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:38:08,200 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:08,201 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:08,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -273436993, now seen corresponding path program 1 times
[2025-02-05 11:38:08,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:08,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408546517]
[2025-02-05 11:38:08,202 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:08,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:08,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes.
[2025-02-05 11:38:08,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements.
[2025-02-05 11:38:08,240 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:08,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:08,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 293 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-02-05 11:38:08,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:08,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408546517]
[2025-02-05 11:38:08,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408546517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:08,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:08,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:08,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280213657]
[2025-02-05 11:38:08,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:08,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:38:08,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:08,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:38:08,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:38:08,591 INFO  L87              Difference]: Start difference. First operand 19530 states and 22327 transitions. Second operand  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:11,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:11,459 INFO  L93              Difference]: Finished difference Result 43601 states and 49453 transitions.
[2025-02-05 11:38:11,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:38:11,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 315
[2025-02-05 11:38:11,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:11,503 INFO  L225             Difference]: With dead ends: 43601
[2025-02-05 11:38:11,503 INFO  L226             Difference]: Without dead ends: 24036
[2025-02-05 11:38:11,524 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:38:11,524 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:11,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 11:38:11,546 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24036 states.
[2025-02-05 11:38:11,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 24036.
[2025-02-05 11:38:11,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24036 states, 24035 states have (on average 1.1185354691075515) internal successors, (26884), 24035 states have internal predecessors, (26884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:11,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24036 states to 24036 states and 26884 transitions.
[2025-02-05 11:38:11,855 INFO  L78                 Accepts]: Start accepts. Automaton has 24036 states and 26884 transitions. Word has length 315
[2025-02-05 11:38:11,856 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:11,856 INFO  L471      AbstractCegarLoop]: Abstraction has 24036 states and 26884 transitions.
[2025-02-05 11:38:11,857 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:11,857 INFO  L276                IsEmpty]: Start isEmpty. Operand 24036 states and 26884 transitions.
[2025-02-05 11:38:11,862 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 327
[2025-02-05 11:38:11,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:11,863 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:11,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:38:11,863 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:11,864 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:11,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726210801, now seen corresponding path program 1 times
[2025-02-05 11:38:11,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:11,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413014077]
[2025-02-05 11:38:11,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:11,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:11,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes.
[2025-02-05 11:38:11,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements.
[2025-02-05 11:38:11,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:11,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:12,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 307 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-02-05 11:38:12,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:12,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413014077]
[2025-02-05 11:38:12,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413014077] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:12,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:12,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:12,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041533448]
[2025-02-05 11:38:12,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:12,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:12,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:12,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:12,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:12,076 INFO  L87              Difference]: Start difference. First operand 24036 states and 26884 transitions. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:15,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:15,114 INFO  L93              Difference]: Finished difference Result 67596 states and 76023 transitions.
[2025-02-05 11:38:15,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:15,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 326
[2025-02-05 11:38:15,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:15,178 INFO  L225             Difference]: With dead ends: 67596
[2025-02-05 11:38:15,178 INFO  L226             Difference]: Without dead ends: 43562
[2025-02-05 11:38:15,200 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:15,200 INFO  L435           NwaCegarLoop]: 1281 mSDtfsCounter, 672 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:15,201 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1289 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:38:15,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43562 states.
[2025-02-05 11:38:15,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43562 to 40558.
[2025-02-05 11:38:15,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40558 states, 40557 states have (on average 1.1171684296175752) internal successors, (45309), 40557 states have internal predecessors, (45309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:15,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 45309 transitions.
[2025-02-05 11:38:15,929 INFO  L78                 Accepts]: Start accepts. Automaton has 40558 states and 45309 transitions. Word has length 326
[2025-02-05 11:38:15,930 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:15,930 INFO  L471      AbstractCegarLoop]: Abstraction has 40558 states and 45309 transitions.
[2025-02-05 11:38:15,931 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:15,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 40558 states and 45309 transitions.
[2025-02-05 11:38:15,934 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2025-02-05 11:38:15,935 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:15,935 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:15,935 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:38:15,936 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:15,936 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:15,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -1871124519, now seen corresponding path program 1 times
[2025-02-05 11:38:15,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:15,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073507324]
[2025-02-05 11:38:15,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:15,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:16,013 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes.
[2025-02-05 11:38:16,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements.
[2025-02-05 11:38:16,041 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:16,041 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:16,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 307 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 11:38:16,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:16,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073507324]
[2025-02-05 11:38:16,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073507324] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:16,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:16,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:16,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485282439]
[2025-02-05 11:38:16,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:16,437 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:16,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:16,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:16,438 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:16,438 INFO  L87              Difference]: Start difference. First operand 40558 states and 45309 transitions. Second operand  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:19,468 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:19,468 INFO  L93              Difference]: Finished difference Result 95383 states and 107858 transitions.
[2025-02-05 11:38:19,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:19,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330
[2025-02-05 11:38:19,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:19,533 INFO  L225             Difference]: With dead ends: 95383
[2025-02-05 11:38:19,534 INFO  L226             Difference]: Without dead ends: 54827
[2025-02-05 11:38:19,559 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:19,560 INFO  L435           NwaCegarLoop]: 462 mSDtfsCounter, 717 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:19,560 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 468 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:38:19,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54827 states.
[2025-02-05 11:38:20,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54827 to 54076.
[2025-02-05 11:38:20,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54076 states, 54075 states have (on average 1.1216643550624132) internal successors, (60654), 54075 states have internal predecessors, (60654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:20,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54076 states to 54076 states and 60654 transitions.
[2025-02-05 11:38:20,529 INFO  L78                 Accepts]: Start accepts. Automaton has 54076 states and 60654 transitions. Word has length 330
[2025-02-05 11:38:20,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:20,530 INFO  L471      AbstractCegarLoop]: Abstraction has 54076 states and 60654 transitions.
[2025-02-05 11:38:20,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:20,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 54076 states and 60654 transitions.
[2025-02-05 11:38:20,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 359
[2025-02-05 11:38:20,535 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:20,535 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:20,535 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:38:20,535 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:20,537 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:20,537 INFO  L85        PathProgramCache]: Analyzing trace with hash 1485170579, now seen corresponding path program 1 times
[2025-02-05 11:38:20,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:20,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740509630]
[2025-02-05 11:38:20,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:20,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:20,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes.
[2025-02-05 11:38:20,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements.
[2025-02-05 11:38:20,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:20,590 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:20,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 335 backedges. 86 proven. 108 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2025-02-05 11:38:20,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:20,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740509630]
[2025-02-05 11:38:20,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740509630] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:38:20,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215432251]
[2025-02-05 11:38:20,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:20,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:38:20,910 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:38:20,914 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 11:38:20,916 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 11:38:21,065 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes.
[2025-02-05 11:38:21,139 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements.
[2025-02-05 11:38:21,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:21,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:21,141 INFO  L256         TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:38:21,151 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:38:21,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 335 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-02-05 11:38:21,271 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:38:21,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [215432251] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:21,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:38:21,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 11:38:21,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590096264]
[2025-02-05 11:38:21,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:21,272 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:21,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:21,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:21,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:38:21,273 INFO  L87              Difference]: Start difference. First operand 54076 states and 60654 transitions. Second operand  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:23,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:23,958 INFO  L93              Difference]: Finished difference Result 130680 states and 148305 transitions.
[2025-02-05 11:38:23,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:23,959 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 358
[2025-02-05 11:38:23,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:24,033 INFO  L225             Difference]: With dead ends: 130680
[2025-02-05 11:38:24,034 INFO  L226             Difference]: Without dead ends: 76606
[2025-02-05 11:38:24,047 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:38:24,048 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:24,048 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 244 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:38:24,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76606 states.
[2025-02-05 11:38:24,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76606 to 75855.
[2025-02-05 11:38:24,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75855 states, 75854 states have (on average 1.1155113771192027) internal successors, (84616), 75854 states have internal predecessors, (84616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:24,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 84616 transitions.
[2025-02-05 11:38:24,886 INFO  L78                 Accepts]: Start accepts. Automaton has 75855 states and 84616 transitions. Word has length 358
[2025-02-05 11:38:24,886 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:24,886 INFO  L471      AbstractCegarLoop]: Abstraction has 75855 states and 84616 transitions.
[2025-02-05 11:38:24,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:24,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 75855 states and 84616 transitions.
[2025-02-05 11:38:24,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 363
[2025-02-05 11:38:24,892 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:24,893 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:24,901 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:38:25,093 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:38:25,093 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:25,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:25,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 1844488073, now seen corresponding path program 1 times
[2025-02-05 11:38:25,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:25,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880837546]
[2025-02-05 11:38:25,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:25,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:25,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes.
[2025-02-05 11:38:25,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements.
[2025-02-05 11:38:25,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:25,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:25,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 339 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:38:25,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:25,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880837546]
[2025-02-05 11:38:25,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880837546] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:25,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:25,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:25,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64810338]
[2025-02-05 11:38:25,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:25,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:25,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:25,410 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:25,410 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:25,410 INFO  L87              Difference]: Start difference. First operand 75855 states and 84616 transitions. Second operand  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:28,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:28,621 INFO  L93              Difference]: Finished difference Result 187005 states and 210374 transitions.
[2025-02-05 11:38:28,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:28,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 362
[2025-02-05 11:38:28,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:28,737 INFO  L225             Difference]: With dead ends: 187005
[2025-02-05 11:38:28,737 INFO  L226             Difference]: Without dead ends: 107397
[2025-02-05 11:38:28,773 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:28,774 INFO  L435           NwaCegarLoop]: 1277 mSDtfsCounter, 773 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:28,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1285 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:38:28,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107397 states.
[2025-02-05 11:38:29,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 101389.
[2025-02-05 11:38:29,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101389 states, 101388 states have (on average 1.0989860733025605) internal successors, (111424), 101388 states have internal predecessors, (111424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:30,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101389 states to 101389 states and 111424 transitions.
[2025-02-05 11:38:30,053 INFO  L78                 Accepts]: Start accepts. Automaton has 101389 states and 111424 transitions. Word has length 362
[2025-02-05 11:38:30,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:30,054 INFO  L471      AbstractCegarLoop]: Abstraction has 101389 states and 111424 transitions.
[2025-02-05 11:38:30,054 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:30,054 INFO  L276                IsEmpty]: Start isEmpty. Operand 101389 states and 111424 transitions.
[2025-02-05 11:38:30,064 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-05 11:38:30,064 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:30,064 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:30,064 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:38:30,064 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:30,065 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:30,065 INFO  L85        PathProgramCache]: Analyzing trace with hash 2138660201, now seen corresponding path program 1 times
[2025-02-05 11:38:30,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:30,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557837638]
[2025-02-05 11:38:30,065 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:30,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:30,117 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-05 11:38:30,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-05 11:38:30,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:30,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:30,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 645 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked.
[2025-02-05 11:38:30,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:30,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557837638]
[2025-02-05 11:38:30,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557837638] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:30,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:30,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:30,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120404256]
[2025-02-05 11:38:30,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:30,489 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:30,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:30,592 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:30,592 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:30,592 INFO  L87              Difference]: Start difference. First operand 101389 states and 111424 transitions. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:33,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:33,695 INFO  L93              Difference]: Finished difference Result 238824 states and 263758 transitions.
[2025-02-05 11:38:33,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:33,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 452
[2025-02-05 11:38:33,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:33,853 INFO  L225             Difference]: With dead ends: 238824
[2025-02-05 11:38:33,853 INFO  L226             Difference]: Without dead ends: 137437
[2025-02-05 11:38:33,902 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:33,903 INFO  L435           NwaCegarLoop]: 1236 mSDtfsCounter, 684 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:33,903 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1244 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:38:33,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137437 states.
[2025-02-05 11:38:35,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137437 to 132931.
[2025-02-05 11:38:35,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132931 states, 132930 states have (on average 1.09942074776198) internal successors, (146146), 132930 states have internal predecessors, (146146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:35,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132931 states to 132931 states and 146146 transitions.
[2025-02-05 11:38:35,655 INFO  L78                 Accepts]: Start accepts. Automaton has 132931 states and 146146 transitions. Word has length 452
[2025-02-05 11:38:35,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:35,655 INFO  L471      AbstractCegarLoop]: Abstraction has 132931 states and 146146 transitions.
[2025-02-05 11:38:35,656 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:35,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 132931 states and 146146 transitions.
[2025-02-05 11:38:35,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 467
[2025-02-05 11:38:35,665 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:35,665 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:38:35,665 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:38:35,665 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:35,665 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:35,666 INFO  L85        PathProgramCache]: Analyzing trace with hash 568983309, now seen corresponding path program 1 times
[2025-02-05 11:38:35,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:35,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658315201]
[2025-02-05 11:38:35,666 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:35,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:35,722 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes.
[2025-02-05 11:38:35,765 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements.
[2025-02-05 11:38:35,765 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:35,765 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:37,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 463 backedges. 405 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:38:37,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:37,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658315201]
[2025-02-05 11:38:37,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658315201] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:38:37,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065375256]
[2025-02-05 11:38:37,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:37,324 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:38:37,325 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:38:37,327 INFO  L229       MonitoredProcess]: Starting monitored process 4 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 11:38:37,340 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:38:37,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes.
[2025-02-05 11:38:37,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements.
[2025-02-05 11:38:37,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:37,480 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:37,482 INFO  L256         TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:38:37,488 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:38:38,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 463 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked.
[2025-02-05 11:38:38,016 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:38:38,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065375256] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:38,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:38:38,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:38:38,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548019665]
[2025-02-05 11:38:38,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:38,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:38:38,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:38,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:38:38,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:38:38,017 INFO  L87              Difference]: Start difference. First operand 132931 states and 146146 transitions. Second operand  has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:43,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:43,220 INFO  L93              Difference]: Finished difference Result 409303 states and 451194 transitions.
[2025-02-05 11:38:43,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:38:43,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 466
[2025-02-05 11:38:43,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:43,528 INFO  L225             Difference]: With dead ends: 409303
[2025-02-05 11:38:43,528 INFO  L226             Difference]: Without dead ends: 276374
[2025-02-05 11:38:43,575 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:38:43,576 INFO  L435           NwaCegarLoop]: 27 mSDtfsCounter, 1780 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4809 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 4809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:43,576 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 42 Invalid, 5357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 4809 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2025-02-05 11:38:43,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 276374 states.
[2025-02-05 11:38:46,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 276374 to 275621.
[2025-02-05 11:38:46,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 275621 states, 275620 states have (on average 1.0981677672157317) internal successors, (302677), 275620 states have internal predecessors, (302677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:47,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 275621 states to 275621 states and 302677 transitions.
[2025-02-05 11:38:47,306 INFO  L78                 Accepts]: Start accepts. Automaton has 275621 states and 302677 transitions. Word has length 466
[2025-02-05 11:38:47,307 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:47,307 INFO  L471      AbstractCegarLoop]: Abstraction has 275621 states and 302677 transitions.
[2025-02-05 11:38:47,307 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:47,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 275621 states and 302677 transitions.
[2025-02-05 11:38:47,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 604
[2025-02-05 11:38:47,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:47,333 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:38:47,341 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 11:38:47,533 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:38:47,534 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:47,534 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:47,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -1338486084, now seen corresponding path program 1 times
[2025-02-05 11:38:47,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:47,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159077353]
[2025-02-05 11:38:47,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:47,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:47,567 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes.
[2025-02-05 11:38:47,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements.
[2025-02-05 11:38:47,596 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:47,596 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:48,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1001 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked.
[2025-02-05 11:38:48,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:48,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159077353]
[2025-02-05 11:38:48,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159077353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:48,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:48,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:48,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92559321]
[2025-02-05 11:38:48,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:48,312 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:48,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:48,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:48,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:48,313 INFO  L87              Difference]: Start difference. First operand 275621 states and 302677 transitions. Second operand  has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)