./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label16.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_label16.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 8986a14436e34fef464bf499036d3f2f22e9dee8c68dd84a0eb0b1e3795f6f62
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:36:15,786 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:36:15,873 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:36:15,879 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:36:15,879 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:36:15,908 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:36:15,908 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:36:15,909 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:36:15,909 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:36:15,909 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:36:15,909 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:36:15,909 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:36:15,910 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:36:15,910 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:36:15,910 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:36:15,910 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:36:15,910 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:36:15,910 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:36:15,911 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:36:15,912 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:36:15,912 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:15,913 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:36:15,913 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:36:15,913 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 -> 8986a14436e34fef464bf499036d3f2f22e9dee8c68dd84a0eb0b1e3795f6f62
[2025-02-05 11:36:16,203 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:36:16,211 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:36:16,213 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:36:16,214 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:36:16,215 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:36:16,217 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label16.c
[2025-02-05 11:36:17,509 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e86cfa5aa/6b16ef3d632c48539909f884f4b53953/FLAG261f12db7
[2025-02-05 11:36:17,992 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:36:17,994 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label16.c
[2025-02-05 11:36:18,033 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e86cfa5aa/6b16ef3d632c48539909f884f4b53953/FLAG261f12db7
[2025-02-05 11:36:18,049 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e86cfa5aa/6b16ef3d632c48539909f884f4b53953
[2025-02-05 11:36:18,053 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:36:18,054 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:36:18,055 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:18,056 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:36:18,059 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:36:18,060 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:18" (1/1) ...
[2025-02-05 11:36:18,061 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba7297a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:18, skipping insertion in model container
[2025-02-05 11:36:18,061 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:18" (1/1) ...
[2025-02-05 11:36:18,152 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:36:18,420 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_label16.c[8006,8019]
[2025-02-05 11:36:19,078 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:19,095 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:36:19,123 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_label16.c[8006,8019]
[2025-02-05 11:36:19,435 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:19,458 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:36:19,459 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19 WrapperNode
[2025-02-05 11:36:19,460 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:19,461 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:19,461 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:36:19,461 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:36:19,467 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:36:19" (1/1) ...
[2025-02-05 11:36:19,533 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:36:19" (1/1) ...
[2025-02-05 11:36:19,890 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:36:19,891 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:19,892 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:36:19,892 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:36:19,892 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:36:19,913 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:19,914 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,041 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,196 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:36:20,197 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,197 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,318 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,337 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,359 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,381 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,452 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:36:20,454 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:36:20,455 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:36:20,455 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:36:20,456 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (1/1) ...
[2025-02-05 11:36:20,461 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:20,474 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:20,490 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:36:20,496 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:36:20,519 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:36:20,519 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:36:20,519 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:36:20,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:36:20,587 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:36:20,589 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:36:25,230 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:36:25,230 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:36:25,230 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:36:25,489 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:36:25,489 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:36:25,533 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:36:25,533 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:36:25,534 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:25 BoogieIcfgContainer
[2025-02-05 11:36:25,534 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:36:25,537 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:36:25,537 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:36:25,542 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:36:25,542 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:18" (1/3) ...
[2025-02-05 11:36:25,543 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212da31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:25, skipping insertion in model container
[2025-02-05 11:36:25,544 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:19" (2/3) ...
[2025-02-05 11:36:25,544 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212da31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:25, skipping insertion in model container
[2025-02-05 11:36:25,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:25" (3/3) ...
[2025-02-05 11:36:25,547 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label16.c
[2025-02-05 11:36:25,561 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:36:25,563 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label16.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:36:25,650 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:36:25,663 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;@19ff68df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:36:25,664 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:36:25,674 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:36:25,682 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-02-05 11:36:25,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:25,683 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:25,684 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:25,689 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:25,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 32558040, now seen corresponding path program 1 times
[2025-02-05 11:36:25,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:25,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166952171]
[2025-02-05 11:36:25,697 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:25,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:25,811 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-05 11:36:25,875 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-05 11:36:25,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:25,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:26,170 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:36:26,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:26,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166952171]
[2025-02-05 11:36:26,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166952171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:26,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:26,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:26,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649922676]
[2025-02-05 11:36:26,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:26,178 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:26,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:26,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:26,196 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:26,200 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 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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:36:29,727 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:29,728 INFO  L93              Difference]: Finished difference Result 2404 states and 4642 transitions.
[2025-02-05 11:36:29,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:29,730 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2025-02-05 11:36:29,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:29,751 INFO  L225             Difference]: With dead ends: 2404
[2025-02-05 11:36:29,751 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:36:29,760 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:36:29,763 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 755 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 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.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:29,763 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-02-05 11:36:29,782 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:36:29,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:36:29,875 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:36:29,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions.
[2025-02-05 11:36:29,889 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 65
[2025-02-05 11:36:29,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:29,889 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions.
[2025-02-05 11:36:29,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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:36:29,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions.
[2025-02-05 11:36:29,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-02-05 11:36:29,894 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:29,895 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:36:29,895 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:36:29,895 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:29,896 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:29,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -1781606753, now seen corresponding path program 1 times
[2025-02-05 11:36:29,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:29,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786569546]
[2025-02-05 11:36:29,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:29,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:29,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-02-05 11:36:29,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-02-05 11:36:29,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:29,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:30,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:36:30,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:30,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786569546]
[2025-02-05 11:36:30,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786569546] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:30,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:30,231 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:30,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408594417]
[2025-02-05 11:36:30,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:30,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:30,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:30,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:30,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:30,239 INFO  L87              Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:36:33,701 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:33,702 INFO  L93              Difference]: Finished difference Result 4514 states and 7250 transitions.
[2025-02-05 11:36:33,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:33,702 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140
[2025-02-05 11:36:33,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:33,715 INFO  L225             Difference]: With dead ends: 4514
[2025-02-05 11:36:33,715 INFO  L226             Difference]: Without dead ends: 3010
[2025-02-05 11:36:33,718 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:36:33,719 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:33,720 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.3s Time]
[2025-02-05 11:36:33,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-02-05 11:36:33,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-02-05 11:36:33,780 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:36:33,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions.
[2025-02-05 11:36:33,787 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 140
[2025-02-05 11:36:33,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:33,788 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions.
[2025-02-05 11:36:33,788 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:36:33,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions.
[2025-02-05 11:36:33,791 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-02-05 11:36:33,791 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:33,791 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:36:33,791 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:36:33,792 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:33,792 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:33,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -766822853, now seen corresponding path program 1 times
[2025-02-05 11:36:33,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:33,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660477026]
[2025-02-05 11:36:33,793 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:33,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:33,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-02-05 11:36:33,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-02-05 11:36:33,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:33,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:34,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:36:34,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:34,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660477026]
[2025-02-05 11:36:34,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660477026] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:34,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:34,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:34,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936765552]
[2025-02-05 11:36:34,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:34,056 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:34,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:34,056 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:34,056 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:34,056 INFO  L87              Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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:36:36,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:36,457 INFO  L93              Difference]: Finished difference Result 9018 states and 13162 transitions.
[2025-02-05 11:36:36,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:36,458 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 169
[2025-02-05 11:36:36,459 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:36,483 INFO  L225             Difference]: With dead ends: 9018
[2025-02-05 11:36:36,483 INFO  L226             Difference]: Without dead ends: 6012
[2025-02-05 11:36:36,489 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:36:36,490 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:36:36,491 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:36:36,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-02-05 11:36:36,593 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-02-05 11:36:36,604 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:36:36,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions.
[2025-02-05 11:36:36,618 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 169
[2025-02-05 11:36:36,619 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:36,620 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions.
[2025-02-05 11:36:36,620 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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:36:36,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions.
[2025-02-05 11:36:36,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 11:36:36,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:36,626 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:36:36,627 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:36:36,627 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:36,627 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:36,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -70613596, now seen corresponding path program 1 times
[2025-02-05 11:36:36,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:36,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514764450]
[2025-02-05 11:36:36,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:36,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:36,664 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 11:36:36,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 11:36:36,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:36,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:37,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-02-05 11:36:37,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:37,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514764450]
[2025-02-05 11:36:37,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514764450] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:36:37,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343332256]
[2025-02-05 11:36:37,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:37,165 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:36:37,166 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:37,169 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:36:37,171 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:36:37,222 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 11:36:37,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 11:36:37,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:37,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:37,267 INFO  L256         TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:36:37,276 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:36:37,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-02-05 11:36:37,585 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:36:37,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343332256] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:37,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:36:37,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:36:37,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421367573]
[2025-02-05 11:36:37,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:37,586 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:37,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:37,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:37,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:36:37,589 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:36:40,117 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:40,117 INFO  L93              Difference]: Finished difference Result 15026 states and 18964 transitions.
[2025-02-05 11:36:40,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:40,118 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 206
[2025-02-05 11:36:40,118 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:40,145 INFO  L225             Difference]: With dead ends: 15026
[2025-02-05 11:36:40,145 INFO  L226             Difference]: Without dead ends: 9016
[2025-02-05 11:36:40,154 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 205 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:36:40,156 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:40,156 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.4s Time]
[2025-02-05 11:36:40,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9016 states.
[2025-02-05 11:36:40,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 8265.
[2025-02-05 11:36:40,336 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:36:40,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 10150 transitions.
[2025-02-05 11:36:40,353 INFO  L78                 Accepts]: Start accepts. Automaton has 8265 states and 10150 transitions. Word has length 206
[2025-02-05 11:36:40,354 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:40,354 INFO  L471      AbstractCegarLoop]: Abstraction has 8265 states and 10150 transitions.
[2025-02-05 11:36:40,355 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:36:40,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 8265 states and 10150 transitions.
[2025-02-05 11:36:40,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-02-05 11:36:40,359 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:40,359 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:40,368 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:36:40,560 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:36:40,561 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:40,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:40,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 1108969097, now seen corresponding path program 1 times
[2025-02-05 11:36:40,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:40,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131640348]
[2025-02-05 11:36:40,562 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:40,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:40,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-02-05 11:36:40,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-02-05 11:36:40,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:40,617 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:40,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-02-05 11:36:40,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:40,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131640348]
[2025-02-05 11:36:40,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131640348] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:40,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:40,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:40,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419577005]
[2025-02-05 11:36:40,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:40,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:36:40,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:40,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:36:40,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:36:40,995 INFO  L87              Difference]: Start difference. First operand 8265 states and 10150 transitions. Second operand  has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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:36:44,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:44,086 INFO  L93              Difference]: Finished difference Result 16604 states and 20373 transitions.
[2025-02-05 11:36:44,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:36:44,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 277
[2025-02-05 11:36:44,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:44,108 INFO  L225             Difference]: With dead ends: 16604
[2025-02-05 11:36:44,108 INFO  L226             Difference]: Without dead ends: 8267
[2025-02-05 11:36:44,115 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:36:44,115 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 852 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 3751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:44,116 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 365 Invalid, 3751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-02-05 11:36:44,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8267 states.
[2025-02-05 11:36:44,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 8265.
[2025-02-05 11:36:44,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8265 states, 8264 states have (on average 1.1977250726040658) internal successors, (9898), 8264 states have internal predecessors, (9898), 0 states have call successors, (0), 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:36:44,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 9898 transitions.
[2025-02-05 11:36:44,323 INFO  L78                 Accepts]: Start accepts. Automaton has 8265 states and 9898 transitions. Word has length 277
[2025-02-05 11:36:44,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:44,323 INFO  L471      AbstractCegarLoop]: Abstraction has 8265 states and 9898 transitions.
[2025-02-05 11:36:44,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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:36:44,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 8265 states and 9898 transitions.
[2025-02-05 11:36:44,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 279
[2025-02-05 11:36:44,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:44,334 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:44,334 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:36:44,334 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:44,339 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:44,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1708911863, now seen corresponding path program 1 times
[2025-02-05 11:36:44,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:44,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602545647]
[2025-02-05 11:36:44,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:44,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:44,395 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes.
[2025-02-05 11:36:44,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements.
[2025-02-05 11:36:44,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:44,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:45,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 193 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-02-05 11:36:45,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:45,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602545647]
[2025-02-05 11:36:45,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602545647] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:45,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:45,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:36:45,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788497705]
[2025-02-05 11:36:45,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:45,145 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:36:45,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:45,146 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:36:45,146 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:36:45,146 INFO  L87              Difference]: Start difference. First operand 8265 states and 9898 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:36:49,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:49,764 INFO  L93              Difference]: Finished difference Result 21785 states and 25452 transitions.
[2025-02-05 11:36:49,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:36:49,764 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 278
[2025-02-05 11:36:49,764 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:49,791 INFO  L225             Difference]: With dead ends: 21785
[2025-02-05 11:36:49,792 INFO  L226             Difference]: Without dead ends: 13522
[2025-02-05 11:36:49,799 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:36:49,800 INFO  L435           NwaCegarLoop]: 606 mSDtfsCounter, 2734 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5950 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 5950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:49,801 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 638 Invalid, 6096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 5950 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time]
[2025-02-05 11:36:49,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13522 states.
[2025-02-05 11:36:49,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13522 to 12020.
[2025-02-05 11:36:49,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12020 states, 12019 states have (on average 1.151676512189034) internal successors, (13842), 12019 states have internal predecessors, (13842), 0 states have call successors, (0), 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:36:49,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13842 transitions.
[2025-02-05 11:36:49,959 INFO  L78                 Accepts]: Start accepts. Automaton has 12020 states and 13842 transitions. Word has length 278
[2025-02-05 11:36:49,959 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:49,959 INFO  L471      AbstractCegarLoop]: Abstraction has 12020 states and 13842 transitions.
[2025-02-05 11:36:49,960 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:36:49,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 12020 states and 13842 transitions.
[2025-02-05 11:36:49,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 361
[2025-02-05 11:36:49,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:49,966 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:36:49,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:36:49,966 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:49,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:49,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -390040708, now seen corresponding path program 1 times
[2025-02-05 11:36:49,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:49,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848441911]
[2025-02-05 11:36:49,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:49,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:50,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes.
[2025-02-05 11:36:50,026 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements.
[2025-02-05 11:36:50,026 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:50,026 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:50,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 409 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-02-05 11:36:50,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:50,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848441911]
[2025-02-05 11:36:50,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848441911] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:50,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:50,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:50,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144505300]
[2025-02-05 11:36:50,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:50,210 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:50,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:50,211 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:50,211 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:50,212 INFO  L87              Difference]: Start difference. First operand 12020 states and 13842 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:36:53,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:53,144 INFO  L93              Difference]: Finished difference Result 36054 states and 41521 transitions.
[2025-02-05 11:36:53,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:53,145 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 360
[2025-02-05 11:36:53,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:53,185 INFO  L225             Difference]: With dead ends: 36054
[2025-02-05 11:36:53,185 INFO  L226             Difference]: Without dead ends: 24036
[2025-02-05 11:36:53,196 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:36:53,197 INFO  L435           NwaCegarLoop]: 1378 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:53,197 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1385 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:36:53,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24036 states.
[2025-02-05 11:36:53,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 22534.
[2025-02-05 11:36:53,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22534 states, 22533 states have (on average 1.1372653441618958) internal successors, (25626), 22533 states have internal predecessors, (25626), 0 states have call successors, (0), 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:36:53,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 25626 transitions.
[2025-02-05 11:36:53,465 INFO  L78                 Accepts]: Start accepts. Automaton has 22534 states and 25626 transitions. Word has length 360
[2025-02-05 11:36:53,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:53,466 INFO  L471      AbstractCegarLoop]: Abstraction has 22534 states and 25626 transitions.
[2025-02-05 11:36:53,466 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:36:53,466 INFO  L276                IsEmpty]: Start isEmpty. Operand 22534 states and 25626 transitions.
[2025-02-05 11:36:53,472 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2025-02-05 11:36:53,473 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:53,473 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:36:53,474 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:36:53,474 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:53,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:53,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1825831878, now seen corresponding path program 1 times
[2025-02-05 11:36:53,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:53,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241300831]
[2025-02-05 11:36:53,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:53,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:53,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.
[2025-02-05 11:36:53,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements.
[2025-02-05 11:36:53,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:53,545 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:54,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 409 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 11:36:54,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:54,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241300831]
[2025-02-05 11:36:54,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241300831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:54,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:54,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:54,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566951679]
[2025-02-05 11:36:54,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:54,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:54,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:54,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:54,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:54,049 INFO  L87              Difference]: Start difference. First operand 22534 states and 25626 transitions. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:36:56,873 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:56,874 INFO  L93              Difference]: Finished difference Result 54078 states and 62348 transitions.
[2025-02-05 11:36:56,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:56,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 364
[2025-02-05 11:36:56,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:56,922 INFO  L225             Difference]: With dead ends: 54078
[2025-02-05 11:36:56,922 INFO  L226             Difference]: Without dead ends: 31546
[2025-02-05 11:36:56,941 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:36:56,942 INFO  L435           NwaCegarLoop]: 500 mSDtfsCounter, 703 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:56,942 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 506 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-02-05 11:36:56,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31546 states.
[2025-02-05 11:36:57,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31546 to 31546.
[2025-02-05 11:36:57,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31546 states, 31545 states have (on average 1.1370106197495642) internal successors, (35867), 31545 states have internal predecessors, (35867), 0 states have call successors, (0), 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:36:57,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31546 states to 31546 states and 35867 transitions.
[2025-02-05 11:36:57,325 INFO  L78                 Accepts]: Start accepts. Automaton has 31546 states and 35867 transitions. Word has length 364
[2025-02-05 11:36:57,325 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:57,326 INFO  L471      AbstractCegarLoop]: Abstraction has 31546 states and 35867 transitions.
[2025-02-05 11:36:57,326 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:36:57,326 INFO  L276                IsEmpty]: Start isEmpty. Operand 31546 states and 35867 transitions.
[2025-02-05 11:36:57,334 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 393
[2025-02-05 11:36:57,334 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:57,334 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:36:57,334 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:36:57,335 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:57,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:57,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -1471509248, now seen corresponding path program 1 times
[2025-02-05 11:36:57,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:57,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374760242]
[2025-02-05 11:36:57,336 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:57,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:57,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-02-05 11:36:57,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-02-05 11:36:57,399 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:57,399 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:57,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 437 backedges. 188 proven. 108 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2025-02-05 11:36:57,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:57,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374760242]
[2025-02-05 11:36:57,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374760242] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:36:57,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523182972]
[2025-02-05 11:36:57,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:57,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:36:57,967 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:57,969 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:36:57,971 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:36:58,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-02-05 11:36:58,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-02-05 11:36:58,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:58,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:58,186 INFO  L256         TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:36:58,197 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:36:58,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 437 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-02-05 11:36:58,326 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:36:58,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [523182972] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:58,326 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:36:58,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 11:36:58,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971082286]
[2025-02-05 11:36:58,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:58,327 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:58,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:58,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:58,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:36:58,328 INFO  L87              Difference]: Start difference. First operand 31546 states and 35867 transitions. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:00,793 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:00,793 INFO  L93              Difference]: Finished difference Result 75106 states and 86624 transitions.
[2025-02-05 11:37:00,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:00,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 392
[2025-02-05 11:37:00,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:00,840 INFO  L225             Difference]: With dead ends: 75106
[2025-02-05 11:37:00,840 INFO  L226             Difference]: Without dead ends: 43562
[2025-02-05 11:37:00,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 391 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:00,860 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 789 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:00,860 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 235 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:37:00,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43562 states.
[2025-02-05 11:37:01,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43562 to 43562.
[2025-02-05 11:37:01,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43562 states, 43561 states have (on average 1.1325727141250201) internal successors, (49336), 43561 states have internal predecessors, (49336), 0 states have call successors, (0), 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:01,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43562 states to 43562 states and 49336 transitions.
[2025-02-05 11:37:01,412 INFO  L78                 Accepts]: Start accepts. Automaton has 43562 states and 49336 transitions. Word has length 392
[2025-02-05 11:37:01,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:01,412 INFO  L471      AbstractCegarLoop]: Abstraction has 43562 states and 49336 transitions.
[2025-02-05 11:37:01,413 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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:01,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 43562 states and 49336 transitions.
[2025-02-05 11:37:01,418 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 397
[2025-02-05 11:37:01,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:01,419 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:37:01,427 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-05 11:37:01,619 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:01,620 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:01,620 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:01,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 766496630, now seen corresponding path program 1 times
[2025-02-05 11:37:01,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:01,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768660182]
[2025-02-05 11:37:01,620 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:01,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:01,655 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes.
[2025-02-05 11:37:01,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements.
[2025-02-05 11:37:01,677 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:01,677 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:02,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 441 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:37:02,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:02,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768660182]
[2025-02-05 11:37:02,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768660182] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:02,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:02,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:02,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255209582]
[2025-02-05 11:37:02,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:02,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:02,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:02,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:02,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:02,049 INFO  L87              Difference]: Start difference. First operand 43562 states and 49336 transitions. Second operand  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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:04,900 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:04,900 INFO  L93              Difference]: Finished difference Result 104395 states and 119070 transitions.
[2025-02-05 11:37:04,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:04,901 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 396
[2025-02-05 11:37:04,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:04,960 INFO  L225             Difference]: With dead ends: 104395
[2025-02-05 11:37:04,960 INFO  L226             Difference]: Without dead ends: 60835
[2025-02-05 11:37:04,977 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:37:04,977 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 714 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:04,977 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 358 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:05,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60835 states.
[2025-02-05 11:37:05,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60835 to 57831.
[2025-02-05 11:37:05,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57831 states, 57830 states have (on average 1.1350337195227391) internal successors, (65639), 57830 states have internal predecessors, (65639), 0 states have call successors, (0), 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:05,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57831 states to 57831 states and 65639 transitions.
[2025-02-05 11:37:05,776 INFO  L78                 Accepts]: Start accepts. Automaton has 57831 states and 65639 transitions. Word has length 396
[2025-02-05 11:37:05,781 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:05,781 INFO  L471      AbstractCegarLoop]: Abstraction has 57831 states and 65639 transitions.
[2025-02-05 11:37:05,782 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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:05,782 INFO  L276                IsEmpty]: Start isEmpty. Operand 57831 states and 65639 transitions.
[2025-02-05 11:37:05,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 421
[2025-02-05 11:37:05,801 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:05,801 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:37:05,801 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:37:05,802 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:05,802 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:05,802 INFO  L85        PathProgramCache]: Analyzing trace with hash 409465394, now seen corresponding path program 1 times
[2025-02-05 11:37:05,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:05,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673111988]
[2025-02-05 11:37:05,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:05,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:05,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes.
[2025-02-05 11:37:05,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements.
[2025-02-05 11:37:05,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:05,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:06,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-02-05 11:37:06,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:06,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673111988]
[2025-02-05 11:37:06,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673111988] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:06,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:06,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:06,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090450849]
[2025-02-05 11:37:06,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:06,139 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:06,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:06,140 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:06,140 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:06,141 INFO  L87              Difference]: Start difference. First operand 57831 states and 65639 transitions. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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:09,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:09,001 INFO  L93              Difference]: Finished difference Result 156214 states and 178802 transitions.
[2025-02-05 11:37:09,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:09,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 420
[2025-02-05 11:37:09,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:09,105 INFO  L225             Difference]: With dead ends: 156214
[2025-02-05 11:37:09,105 INFO  L226             Difference]: Without dead ends: 98385
[2025-02-05 11:37:09,131 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:37:09,132 INFO  L435           NwaCegarLoop]: 1263 mSDtfsCounter, 711 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:09,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1271 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:09,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98385 states.
[2025-02-05 11:37:10,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98385 to 90875.
[2025-02-05 11:37:10,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90875 states, 90874 states have (on average 1.1124303981336796) internal successors, (101091), 90874 states have internal predecessors, (101091), 0 states have call successors, (0), 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:10,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90875 states to 90875 states and 101091 transitions.
[2025-02-05 11:37:10,346 INFO  L78                 Accepts]: Start accepts. Automaton has 90875 states and 101091 transitions. Word has length 420
[2025-02-05 11:37:10,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:10,347 INFO  L471      AbstractCegarLoop]: Abstraction has 90875 states and 101091 transitions.
[2025-02-05 11:37:10,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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:10,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 90875 states and 101091 transitions.
[2025-02-05 11:37:10,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 487
[2025-02-05 11:37:10,358 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:10,358 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 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]
[2025-02-05 11:37:10,358 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:37:10,359 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:10,359 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:10,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 1518355894, now seen corresponding path program 1 times
[2025-02-05 11:37:10,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:10,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657370652]
[2025-02-05 11:37:10,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:10,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:10,397 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes.
[2025-02-05 11:37:10,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements.
[2025-02-05 11:37:10,421 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:10,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:10,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 752 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:37:10,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:10,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657370652]
[2025-02-05 11:37:10,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657370652] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:10,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:10,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:10,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82039220]
[2025-02-05 11:37:10,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:10,788 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:10,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:10,789 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:10,790 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:10,790 INFO  L87              Difference]: Start difference. First operand 90875 states and 101091 transitions. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:13,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:13,922 INFO  L93              Difference]: Finished difference Result 225306 states and 252531 transitions.
[2025-02-05 11:37:13,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:13,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 486
[2025-02-05 11:37:13,923 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:14,089 INFO  L225             Difference]: With dead ends: 225306
[2025-02-05 11:37:14,089 INFO  L226             Difference]: Without dead ends: 130678
[2025-02-05 11:37:14,134 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:37:14,134 INFO  L435           NwaCegarLoop]: 1270 mSDtfsCounter, 713 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:14,134 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1277 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:14,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130678 states.
[2025-02-05 11:37:15,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130678 to 126172.
[2025-02-05 11:37:15,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126172 states, 126171 states have (on average 1.0943639980661166) internal successors, (138077), 126171 states have internal predecessors, (138077), 0 states have call successors, (0), 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:15,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126172 states to 126172 states and 138077 transitions.
[2025-02-05 11:37:15,327 INFO  L78                 Accepts]: Start accepts. Automaton has 126172 states and 138077 transitions. Word has length 486
[2025-02-05 11:37:15,328 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:15,328 INFO  L471      AbstractCegarLoop]: Abstraction has 126172 states and 138077 transitions.
[2025-02-05 11:37:15,328 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:15,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 126172 states and 138077 transitions.
[2025-02-05 11:37:15,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 499
[2025-02-05 11:37:15,340 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:15,340 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:37:15,341 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:15,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:15,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 2133070804, now seen corresponding path program 1 times
[2025-02-05 11:37:15,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:15,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263060615]
[2025-02-05 11:37:15,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:15,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:15,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes.
[2025-02-05 11:37:15,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements.
[2025-02-05 11:37:15,398 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:15,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:16,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 793 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-02-05 11:37:16,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:16,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263060615]
[2025-02-05 11:37:16,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263060615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:16,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:16,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:16,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685987188]
[2025-02-05 11:37:16,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:16,008 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:16,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:16,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:16,010 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:16,010 INFO  L87              Difference]: Start difference. First operand 126172 states and 138077 transitions. Second operand  has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:19,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:19,054 INFO  L93              Difference]: Finished difference Result 256097 states and 279800 transitions.
[2025-02-05 11:37:19,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:19,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 498
[2025-02-05 11:37:19,055 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:19,211 INFO  L225             Difference]: With dead ends: 256097
[2025-02-05 11:37:19,211 INFO  L226             Difference]: Without dead ends: 129176
[2025-02-05 11:37:19,281 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:37:19,282 INFO  L435           NwaCegarLoop]: 1167 mSDtfsCounter, 694 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:19,282 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1175 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:19,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129176 states.
[2025-02-05 11:37:20,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129176 to 125421.
[2025-02-05 11:37:20,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125421 states, 125420 states have (on average 1.082435018338383) internal successors, (135759), 125420 states have internal predecessors, (135759), 0 states have call successors, (0), 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:20,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 135759 transitions.
[2025-02-05 11:37:20,878 INFO  L78                 Accepts]: Start accepts. Automaton has 125421 states and 135759 transitions. Word has length 498
[2025-02-05 11:37:20,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:20,878 INFO  L471      AbstractCegarLoop]: Abstraction has 125421 states and 135759 transitions.
[2025-02-05 11:37:20,879 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:20,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 125421 states and 135759 transitions.
[2025-02-05 11:37:20,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 503
[2025-02-05 11:37:20,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:20,890 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:37:20,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:37:20,890 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:20,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:20,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -544496010, now seen corresponding path program 1 times
[2025-02-05 11:37:20,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:20,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201591189]
[2025-02-05 11:37:20,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:20,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:20,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-02-05 11:37:20,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-02-05 11:37:20,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:20,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:21,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 796 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked.
[2025-02-05 11:37:21,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:21,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201591189]
[2025-02-05 11:37:21,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201591189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:21,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:21,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:21,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859567947]
[2025-02-05 11:37:21,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:21,382 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:21,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:21,383 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:21,383 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:21,383 INFO  L87              Difference]: Start difference. First operand 125421 states and 135759 transitions. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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:24,473 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:24,473 INFO  L93              Difference]: Finished difference Result 286888 states and 311624 transitions.
[2025-02-05 11:37:24,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:24,474 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 502
[2025-02-05 11:37:24,474 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:24,655 INFO  L225             Difference]: With dead ends: 286888
[2025-02-05 11:37:24,655 INFO  L226             Difference]: Without dead ends: 161469
[2025-02-05 11:37:24,719 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:37:24,719 INFO  L435           NwaCegarLoop]: 1270 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:24,719 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1278 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:25,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 161469 states.
[2025-02-05 11:37:26,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 161469 to 156963.
[2025-02-05 11:37:26,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 156963 states, 156962 states have (on average 1.0750245282297626) internal successors, (168738), 156962 states have internal predecessors, (168738), 0 states have call successors, (0), 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:26,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156963 states to 156963 states and 168738 transitions.
[2025-02-05 11:37:26,587 INFO  L78                 Accepts]: Start accepts. Automaton has 156963 states and 168738 transitions. Word has length 502
[2025-02-05 11:37:26,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:26,588 INFO  L471      AbstractCegarLoop]: Abstraction has 156963 states and 168738 transitions.
[2025-02-05 11:37:26,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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:26,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 156963 states and 168738 transitions.
[2025-02-05 11:37:26,604 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 557
[2025-02-05 11:37:26,604 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:26,605 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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]
[2025-02-05 11:37:26,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:37:26,605 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:26,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:26,606 INFO  L85        PathProgramCache]: Analyzing trace with hash -1423743899, now seen corresponding path program 1 times
[2025-02-05 11:37:26,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:26,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076332508]
[2025-02-05 11:37:26,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:26,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:26,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes.
[2025-02-05 11:37:26,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements.
[2025-02-05 11:37:26,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:26,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:26,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 834 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked.
[2025-02-05 11:37:26,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:26,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076332508]
[2025-02-05 11:37:26,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076332508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:26,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:26,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:26,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679053402]
[2025-02-05 11:37:26,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:26,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:26,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:26,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:26,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:26,867 INFO  L87              Difference]: Start difference. First operand 156963 states and 168738 transitions. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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:30,105 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:30,105 INFO  L93              Difference]: Finished difference Result 339458 states and 365124 transitions.
[2025-02-05 11:37:30,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:30,106 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 556
[2025-02-05 11:37:30,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:30,302 INFO  L225             Difference]: With dead ends: 339458
[2025-02-05 11:37:30,302 INFO  L226             Difference]: Without dead ends: 182497
[2025-02-05 11:37:30,362 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:37:30,362 INFO  L435           NwaCegarLoop]: 1112 mSDtfsCounter, 808 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:30,362 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1120 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:37:30,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 182497 states.