./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label20.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_label20.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 702e32bde69e0b1ece4e7732f8bcc90ed2c9bf4432a02312b63f0298ad23fbb9
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:36:37,301 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:36:37,346 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:37,349 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:36:37,349 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:36:37,369 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:36:37,370 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:36:37,370 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:36:37,370 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:36:37,370 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:36:37,370 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:36:37,370 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:36:37,374 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:36:37,375 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:36:37,375 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:36:37,375 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:37,376 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:36:37,376 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:36:37,376 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 -> 702e32bde69e0b1ece4e7732f8bcc90ed2c9bf4432a02312b63f0298ad23fbb9
[2025-02-05 11:36:37,662 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:36:37,668 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:36:37,670 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:36:37,671 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:36:37,671 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:36:37,672 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label20.c
[2025-02-05 11:36:38,887 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d2427266/aab502dbf1ba499fa43a6e1e15cc2c3f/FLAGf196aa5a2
[2025-02-05 11:36:39,379 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:36:39,379 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label20.c
[2025-02-05 11:36:39,401 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d2427266/aab502dbf1ba499fa43a6e1e15cc2c3f/FLAGf196aa5a2
[2025-02-05 11:36:39,490 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d2427266/aab502dbf1ba499fa43a6e1e15cc2c3f
[2025-02-05 11:36:39,492 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:36:39,493 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:36:39,495 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:39,496 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:36:39,499 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:36:39,500 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:39" (1/1) ...
[2025-02-05 11:36:39,502 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62723ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:39, skipping insertion in model container
[2025-02-05 11:36:39,502 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:39" (1/1) ...
[2025-02-05 11:36:39,576 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:36:39,737 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_label20.c[1898,1911]
[2025-02-05 11:36:40,197 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:40,203 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:36:40,211 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_label20.c[1898,1911]
[2025-02-05 11:36:40,480 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:36:40,496 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:36:40,497 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:40 WrapperNode
[2025-02-05 11:36:40,497 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:36:40,498 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:40,499 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:36:40,499 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:36:40,502 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:40" (1/1) ...
[2025-02-05 11:36:40,541 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:40" (1/1) ...
[2025-02-05 11:36:40,796 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:36:40,796 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:36:40,797 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:36:40,797 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:36:40,797 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:36:40,804 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:40" (1/1) ...
[2025-02-05 11:36:40,804 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:40" (1/1) ...
[2025-02-05 11:36:40,832 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:40" (1/1) ...
[2025-02-05 11:36:40,996 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:40,997 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:40" (1/1) ...
[2025-02-05 11:36:40,997 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:40" (1/1) ...
[2025-02-05 11:36:41,137 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:40" (1/1) ...
[2025-02-05 11:36:41,151 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:40" (1/1) ...
[2025-02-05 11:36:41,182 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:40" (1/1) ...
[2025-02-05 11:36:41,197 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:40" (1/1) ...
[2025-02-05 11:36:41,227 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:36:41,228 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:36:41,228 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:36:41,228 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:36:41,229 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:40" (1/1) ...
[2025-02-05 11:36:41,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:36:41,244 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:36:41,258 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:41,266 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:41,283 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:36:41,284 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:36:41,284 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:36:41,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:36:41,341 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:36:41,342 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:36:44,350 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:36:44,350 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:36:44,350 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:36:44,514 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:36:44,514 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:36:44,533 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:36:44,533 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:36:44,534 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:44 BoogieIcfgContainer
[2025-02-05 11:36:44,534 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:36:44,535 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:36:44,536 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:36:44,539 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:36:44,539 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:39" (1/3) ...
[2025-02-05 11:36:44,539 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce0ecec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:44, skipping insertion in model container
[2025-02-05 11:36:44,539 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:40" (2/3) ...
[2025-02-05 11:36:44,540 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce0ecec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:44, skipping insertion in model container
[2025-02-05 11:36:44,540 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:44" (3/3) ...
[2025-02-05 11:36:44,540 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label20.c
[2025-02-05 11:36:44,550 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:36:44,551 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label20.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:36:44,600 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:36:44,607 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;@159ad527, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:36:44,607 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:36:44,612 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:44,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-02-05 11:36:44,615 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:44,615 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:44,615 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:44,618 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:44,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -2091906635, now seen corresponding path program 1 times
[2025-02-05 11:36:44,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:44,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271247661]
[2025-02-05 11:36:44,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:44,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:44,667 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-05 11:36:44,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-05 11:36:44,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:44,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:44,742 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:44,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:44,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271247661]
[2025-02-05 11:36:44,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271247661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:44,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:44,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:44,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860914529]
[2025-02-05 11:36:44,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:44,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:44,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:44,759 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:44,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:44,762 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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:47,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:47,729 INFO  L93              Difference]: Finished difference Result 2388 states and 4626 transitions.
[2025-02-05 11:36:47,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:47,730 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12
[2025-02-05 11:36:47,731 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:47,743 INFO  L225             Difference]: With dead ends: 2388
[2025-02-05 11:36:47,744 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:36:47,747 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:47,749 INFO  L435           NwaCegarLoop]: 102 mSDtfsCounter, 824 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:47,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:36:47,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:36:47,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:36:47,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 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:47,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions.
[2025-02-05 11:36:47,821 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 12
[2025-02-05 11:36:47,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:47,822 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions.
[2025-02-05 11:36:47,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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:47,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions.
[2025-02-05 11:36:47,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 11:36:47,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:47,823 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 11:36:47,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:36:47,824 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:47,824 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:47,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 115817800, now seen corresponding path program 1 times
[2025-02-05 11:36:47,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:47,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636321475]
[2025-02-05 11:36:47,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:47,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:47,839 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 11:36:47,861 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 11:36:47,861 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:47,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:48,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:36:48,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:48,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636321475]
[2025-02-05 11:36:48,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636321475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:48,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:48,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:48,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389490735]
[2025-02-05 11:36:48,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:48,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:48,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:48,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:48,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:48,024 INFO  L87              Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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:50,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:50,751 INFO  L93              Difference]: Finished difference Result 4514 states and 8420 transitions.
[2025-02-05 11:36:50,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:50,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-02-05 11:36:50,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:50,762 INFO  L225             Difference]: With dead ends: 4514
[2025-02-05 11:36:50,762 INFO  L226             Difference]: Without dead ends: 3010
[2025-02-05 11:36:50,766 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:50,767 INFO  L435           NwaCegarLoop]: 346 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:50,767 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 353 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-02-05 11:36:50,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-02-05 11:36:50,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-02-05 11:36:50,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.6511473229132025) internal successors, (4965), 3007 states have internal predecessors, (4965), 0 states have call successors, (0), 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:50,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4965 transitions.
[2025-02-05 11:36:50,861 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4965 transitions. Word has length 77
[2025-02-05 11:36:50,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:50,861 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4965 transitions.
[2025-02-05 11:36:50,862 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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:50,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4965 transitions.
[2025-02-05 11:36:50,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-05 11:36:50,867 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:50,867 INFO  L218           NwaCegarLoop]: trace histogram [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:50,868 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:36:50,868 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:50,868 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:50,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -1043337735, now seen corresponding path program 1 times
[2025-02-05 11:36:50,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:50,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655566043]
[2025-02-05 11:36:50,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:50,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:50,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-05 11:36:50,890 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-05 11:36:50,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:50,890 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:50,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-02-05 11:36:50,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:50,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655566043]
[2025-02-05 11:36:50,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655566043] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:50,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:50,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:50,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119897666]
[2025-02-05 11:36:50,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:50,964 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:50,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:50,965 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:50,965 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:50,965 INFO  L87              Difference]: Start difference. First operand 3008 states and 4965 transitions. Second operand  has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:53,363 INFO  L93              Difference]: Finished difference Result 9018 states and 14890 transitions.
[2025-02-05 11:36:53,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:36:53,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 83
[2025-02-05 11:36:53,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:53,402 INFO  L225             Difference]: With dead ends: 9018
[2025-02-05 11:36:53,402 INFO  L226             Difference]: Without dead ends: 6012
[2025-02-05 11:36:53,408 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:53,411 INFO  L435           NwaCegarLoop]: 479 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:53,412 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 486 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:36:53,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-02-05 11:36:53,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-02-05 11:36:53,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6012 states, 6011 states have (on average 1.4355348527699219) internal successors, (8629), 6011 states have internal predecessors, (8629), 0 states have call successors, (0), 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,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 8629 transitions.
[2025-02-05 11:36:53,481 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 8629 transitions. Word has length 83
[2025-02-05 11:36:53,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:53,483 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 8629 transitions.
[2025-02-05 11:36:53,483 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 8629 transitions.
[2025-02-05 11:36:53,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-02-05 11:36:53,487 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:53,487 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:36:53,487 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:36:53,488 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:53,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:53,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 1320491731, now seen corresponding path program 1 times
[2025-02-05 11:36:53,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:53,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764849906]
[2025-02-05 11:36:53,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:53,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:53,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-02-05 11:36:53,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-02-05 11:36:53,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:53,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:53,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:36:53,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:53,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764849906]
[2025-02-05 11:36:53,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764849906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:53,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:53,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:36:53,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847361766]
[2025-02-05 11:36:53,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:53,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:36:53,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:53,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:36:53,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:36:53,818 INFO  L87              Difference]: Start difference. First operand 6012 states and 8629 transitions. Second operand  has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:36:57,453 INFO  L93              Difference]: Finished difference Result 18789 states and 26749 transitions.
[2025-02-05 11:36:57,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:36:57,457 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128
[2025-02-05 11:36:57,457 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:36:57,489 INFO  L225             Difference]: With dead ends: 18789
[2025-02-05 11:36:57,489 INFO  L226             Difference]: Without dead ends: 12779
[2025-02-05 11:36:57,498 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:36:57,502 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 2208 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 4631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:36:57,502 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 199 Invalid, 4631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time]
[2025-02-05 11:36:57,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12779 states.
[2025-02-05 11:36:57,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 12771.
[2025-02-05 11:36:57,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12771 states, 12770 states have (on average 1.3614722004698512) internal successors, (17386), 12770 states have internal predecessors, (17386), 0 states have call successors, (0), 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,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 17386 transitions.
[2025-02-05 11:36:57,686 INFO  L78                 Accepts]: Start accepts. Automaton has 12771 states and 17386 transitions. Word has length 128
[2025-02-05 11:36:57,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:36:57,687 INFO  L471      AbstractCegarLoop]: Abstraction has 12771 states and 17386 transitions.
[2025-02-05 11:36:57,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 12771 states and 17386 transitions.
[2025-02-05 11:36:57,690 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 276
[2025-02-05 11:36:57,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:36:57,691 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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,691 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:36:57,691 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:36:57,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:36:57,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094521415, now seen corresponding path program 1 times
[2025-02-05 11:36:57,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:36:57,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998157448]
[2025-02-05 11:36:57,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:36:57,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:36:57,722 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes.
[2025-02-05 11:36:57,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements.
[2025-02-05 11:36:57,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:36:57,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:36:57,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 140 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked.
[2025-02-05 11:36:57,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:36:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998157448]
[2025-02-05 11:36:57,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998157448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:36:57,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:36:57,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:36:57,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935541970]
[2025-02-05 11:36:57,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:36:58,000 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:36:58,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:36:58,000 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:36:58,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:36:58,000 INFO  L87              Difference]: Start difference. First operand 12771 states and 17386 transitions. Second operand  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:00,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:00,632 INFO  L93              Difference]: Finished difference Result 36805 states and 50525 transitions.
[2025-02-05 11:37:00,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:00,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275
[2025-02-05 11:37:00,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:00,715 INFO  L225             Difference]: With dead ends: 36805
[2025-02-05 11:37:00,716 INFO  L226             Difference]: Without dead ends: 24036
[2025-02-05 11:37:00,735 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:00,739 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 706 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 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.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:00,739 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:00,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24036 states.
[2025-02-05 11:37:01,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21783.
[2025-02-05 11:37:01,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21783 states, 21782 states have (on average 1.2684785602791295) internal successors, (27630), 21782 states have internal predecessors, (27630), 0 states have call successors, (0), 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,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 27630 transitions.
[2025-02-05 11:37:01,244 INFO  L78                 Accepts]: Start accepts. Automaton has 21783 states and 27630 transitions. Word has length 275
[2025-02-05 11:37:01,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:01,245 INFO  L471      AbstractCegarLoop]: Abstraction has 21783 states and 27630 transitions.
[2025-02-05 11:37:01,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:01,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 21783 states and 27630 transitions.
[2025-02-05 11:37:01,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-02-05 11:37:01,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:01,251 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:01,251 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:37:01,251 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:01,252 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:01,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1864756096, now seen corresponding path program 1 times
[2025-02-05 11:37:01,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:01,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699116951]
[2025-02-05 11:37:01,252 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:01,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:01,274 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-02-05 11:37:01,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-02-05 11:37:01,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:01,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:01,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 291 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-02-05 11:37:01,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:01,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699116951]
[2025-02-05 11:37:01,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699116951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:01,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:01,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:01,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281663382]
[2025-02-05 11:37:01,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:01,627 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:37:01,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:01,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:37:01,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:37:01,628 INFO  L87              Difference]: Start difference. First operand 21783 states and 27630 transitions. Second operand  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:04,147 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:04,147 INFO  L93              Difference]: Finished difference Result 47356 states and 59482 transitions.
[2025-02-05 11:37:04,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:37:04,148 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349
[2025-02-05 11:37:04,148 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:04,179 INFO  L225             Difference]: With dead ends: 47356
[2025-02-05 11:37:04,179 INFO  L226             Difference]: Without dead ends: 25538
[2025-02-05 11:37:04,194 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:37:04,194 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:04,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:04,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25538 states.
[2025-02-05 11:37:04,365 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 25538.
[2025-02-05 11:37:04,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25538 states, 25537 states have (on average 1.2295101225672553) internal successors, (31398), 25537 states have internal predecessors, (31398), 0 states have call successors, (0), 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,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 31398 transitions.
[2025-02-05 11:37:04,408 INFO  L78                 Accepts]: Start accepts. Automaton has 25538 states and 31398 transitions. Word has length 349
[2025-02-05 11:37:04,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:04,408 INFO  L471      AbstractCegarLoop]: Abstraction has 25538 states and 31398 transitions.
[2025-02-05 11:37:04,409 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:04,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 25538 states and 31398 transitions.
[2025-02-05 11:37:04,413 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2025-02-05 11:37:04,413 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:04,413 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:37:04,413 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:37:04,413 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:04,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:04,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388283366, now seen corresponding path program 1 times
[2025-02-05 11:37:04,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:04,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431767349]
[2025-02-05 11:37:04,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:04,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:04,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.
[2025-02-05 11:37:04,451 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements.
[2025-02-05 11:37:04,451 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:04,451 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:04,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 319 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 11:37:04,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:04,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431767349]
[2025-02-05 11:37:04,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431767349] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:04,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:04,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:04,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839564846]
[2025-02-05 11:37:04,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:04,630 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:04,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:04,630 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:04,630 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:04,630 INFO  L87              Difference]: Start difference. First operand 25538 states and 31398 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:07,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:07,150 INFO  L93              Difference]: Finished difference Result 64592 states and 78870 transitions.
[2025-02-05 11:37:07,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:07,151 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:37:07,151 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:07,206 INFO  L225             Difference]: With dead ends: 64592
[2025-02-05 11:37:07,206 INFO  L226             Difference]: Without dead ends: 39056
[2025-02-05 11:37:07,225 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:07,226 INFO  L435           NwaCegarLoop]: 1337 mSDtfsCounter, 669 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:07,226 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1345 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:07,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39056 states.
[2025-02-05 11:37:07,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 38305.
[2025-02-05 11:37:07,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38305 states, 38304 states have (on average 1.1858552631578947) internal successors, (45423), 38304 states have internal predecessors, (45423), 0 states have call successors, (0), 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:07,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 45423 transitions.
[2025-02-05 11:37:07,559 INFO  L78                 Accepts]: Start accepts. Automaton has 38305 states and 45423 transitions. Word has length 364
[2025-02-05 11:37:07,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:07,560 INFO  L471      AbstractCegarLoop]: Abstraction has 38305 states and 45423 transitions.
[2025-02-05 11:37:07,560 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:07,561 INFO  L276                IsEmpty]: Start isEmpty. Operand 38305 states and 45423 transitions.
[2025-02-05 11:37:07,565 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 369
[2025-02-05 11:37:07,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:07,566 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:07,566 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:37:07,566 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:07,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:07,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -68336804, now seen corresponding path program 1 times
[2025-02-05 11:37:07,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:07,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887911335]
[2025-02-05 11:37:07,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:07,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:07,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes.
[2025-02-05 11:37:07,602 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements.
[2025-02-05 11:37:07,602 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:07,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:07,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 341 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2025-02-05 11:37:07,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:07,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887911335]
[2025-02-05 11:37:07,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887911335] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:07,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:07,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:07,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007647079]
[2025-02-05 11:37:07,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:07,731 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:07,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:07,732 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:07,732 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:07,732 INFO  L87              Difference]: Start difference. First operand 38305 states and 45423 transitions. Second operand  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:10,350 INFO  L93              Difference]: Finished difference Result 94632 states and 114241 transitions.
[2025-02-05 11:37:10,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:10,350 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 368
[2025-02-05 11:37:10,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:10,419 INFO  L225             Difference]: With dead ends: 94632
[2025-02-05 11:37:10,419 INFO  L226             Difference]: Without dead ends: 56329
[2025-02-05 11:37:10,449 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:10,449 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:10,449 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 238 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:10,495 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56329 states.
[2025-02-05 11:37:11,116 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56329 to 54827.
[2025-02-05 11:37:11,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54827 states, 54826 states have (on average 1.181902746871922) internal successors, (64799), 54826 states have internal predecessors, (64799), 0 states have call successors, (0), 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:11,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54827 states to 54827 states and 64799 transitions.
[2025-02-05 11:37:11,225 INFO  L78                 Accepts]: Start accepts. Automaton has 54827 states and 64799 transitions. Word has length 368
[2025-02-05 11:37:11,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:11,225 INFO  L471      AbstractCegarLoop]: Abstraction has 54827 states and 64799 transitions.
[2025-02-05 11:37:11,227 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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:11,227 INFO  L276                IsEmpty]: Start isEmpty. Operand 54827 states and 64799 transitions.
[2025-02-05 11:37:11,233 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-02-05 11:37:11,233 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:11,233 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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]
[2025-02-05 11:37:11,234 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:37:11,234 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:11,234 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:11,235 INFO  L85        PathProgramCache]: Analyzing trace with hash -878808645, now seen corresponding path program 1 times
[2025-02-05 11:37:11,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:11,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597338964]
[2025-02-05 11:37:11,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:11,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:11,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-02-05 11:37:11,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-02-05 11:37:11,295 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:11,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:11,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 486 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-02-05 11:37:11,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:11,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597338964]
[2025-02-05 11:37:11,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597338964] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:11,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:11,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:11,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218091737]
[2025-02-05 11:37:11,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:11,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:11,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:11,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:11,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:11,506 INFO  L87              Difference]: Start difference. First operand 54827 states and 64799 transitions. Second operand  has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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:14,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:14,441 INFO  L93              Difference]: Finished difference Result 134435 states and 158880 transitions.
[2025-02-05 11:37:14,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:14,441 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 404
[2025-02-05 11:37:14,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:14,540 INFO  L225             Difference]: With dead ends: 134435
[2025-02-05 11:37:14,541 INFO  L226             Difference]: Without dead ends: 79610
[2025-02-05 11:37:14,569 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,573 INFO  L435           NwaCegarLoop]: 1245 mSDtfsCounter, 642 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:14,573 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1253 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 11:37:14,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79610 states.
[2025-02-05 11:37:15,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79610 to 75855.
[2025-02-05 11:37:15,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75855 states, 75854 states have (on average 1.1766683365412502) internal successors, (89255), 75854 states have internal predecessors, (89255), 0 states have call successors, (0), 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,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 89255 transitions.
[2025-02-05 11:37:15,280 INFO  L78                 Accepts]: Start accepts. Automaton has 75855 states and 89255 transitions. Word has length 404
[2025-02-05 11:37:15,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:15,280 INFO  L471      AbstractCegarLoop]: Abstraction has 75855 states and 89255 transitions.
[2025-02-05 11:37:15,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 75855 states and 89255 transitions.
[2025-02-05 11:37:15,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 408
[2025-02-05 11:37:15,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:15,286 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:37:15,286 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:15,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:15,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1569423636, now seen corresponding path program 1 times
[2025-02-05 11:37:15,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:15,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587544899]
[2025-02-05 11:37:15,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:15,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:15,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes.
[2025-02-05 11:37:15,337 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements.
[2025-02-05 11:37:15,337 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:15,337 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:15,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-02-05 11:37:15,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:15,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587544899]
[2025-02-05 11:37:15,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587544899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:15,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:15,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:15,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107638299]
[2025-02-05 11:37:15,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:15,479 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:15,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:15,480 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:15,480 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:15,480 INFO  L87              Difference]: Start difference. First operand 75855 states and 89255 transitions. Second operand  has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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:18,565 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:18,566 INFO  L93              Difference]: Finished difference Result 154712 states and 181579 transitions.
[2025-02-05 11:37:18,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:18,566 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 407
[2025-02-05 11:37:18,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:18,644 INFO  L225             Difference]: With dead ends: 154712
[2025-02-05 11:37:18,644 INFO  L226             Difference]: Without dead ends: 75855
[2025-02-05 11:37:18,685 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:18,686 INFO  L435           NwaCegarLoop]: 1228 mSDtfsCounter, 743 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:18,686 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1235 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:37:18,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75855 states.
[2025-02-05 11:37:19,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75855 to 70598.
[2025-02-05 11:37:19,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70598 states, 70597 states have (on average 1.1260818448375993) internal successors, (79498), 70597 states have internal predecessors, (79498), 0 states have call successors, (0), 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,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70598 states to 70598 states and 79498 transitions.
[2025-02-05 11:37:19,711 INFO  L78                 Accepts]: Start accepts. Automaton has 70598 states and 79498 transitions. Word has length 407
[2025-02-05 11:37:19,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:19,711 INFO  L471      AbstractCegarLoop]: Abstraction has 70598 states and 79498 transitions.
[2025-02-05 11:37:19,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 70598 states and 79498 transitions.
[2025-02-05 11:37:19,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 409
[2025-02-05 11:37:19,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:19,715 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1]
[2025-02-05 11:37:19,715 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:37:19,715 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:19,716 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:19,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 582433669, now seen corresponding path program 1 times
[2025-02-05 11:37:19,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:19,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35436298]
[2025-02-05 11:37:19,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:19,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:19,738 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes.
[2025-02-05 11:37:19,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements.
[2025-02-05 11:37:19,752 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:19,752 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:20,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 486 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-02-05 11:37:20,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:20,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35436298]
[2025-02-05 11:37:20,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35436298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:20,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:20,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 11:37:20,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106442383]
[2025-02-05 11:37:20,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:20,178 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:37:20,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:20,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:37:20,178 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:20,178 INFO  L87              Difference]: Start difference. First operand 70598 states and 79498 transitions. Second operand  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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:23,134 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:23,134 INFO  L93              Difference]: Finished difference Result 154915 states and 173740 transitions.
[2025-02-05 11:37:23,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:37:23,135 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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 408
[2025-02-05 11:37:23,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:23,222 INFO  L225             Difference]: With dead ends: 154915
[2025-02-05 11:37:23,222 INFO  L226             Difference]: Without dead ends: 80564
[2025-02-05 11:37:23,262 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:23,263 INFO  L435           NwaCegarLoop]: 1366 mSDtfsCounter, 772 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4026 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 4026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:23,263 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1388 Invalid, 4679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 4026 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-02-05 11:37:23,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80564 states.
[2025-02-05 11:37:23,837 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80564 to 71349.
[2025-02-05 11:37:23,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71349 states, 71348 states have (on average 1.1063940124460392) internal successors, (78939), 71348 states have internal predecessors, (78939), 0 states have call successors, (0), 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,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71349 states to 71349 states and 78939 transitions.
[2025-02-05 11:37:24,096 INFO  L78                 Accepts]: Start accepts. Automaton has 71349 states and 78939 transitions. Word has length 408
[2025-02-05 11:37:24,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:24,097 INFO  L471      AbstractCegarLoop]: Abstraction has 71349 states and 78939 transitions.
[2025-02-05 11:37:24,097 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 71349 states and 78939 transitions.
[2025-02-05 11:37:24,100 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 410
[2025-02-05 11:37:24,100 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:24,101 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:24,101 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:37:24,101 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:24,101 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:24,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 939187473, now seen corresponding path program 1 times
[2025-02-05 11:37:24,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:24,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130274769]
[2025-02-05 11:37:24,102 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:24,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:24,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes.
[2025-02-05 11:37:24,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements.
[2025-02-05 11:37:24,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:24,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:24,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 492 backedges. 315 proven. 63 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked.
[2025-02-05 11:37:24,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:24,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130274769]
[2025-02-05 11:37:24,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130274769] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:24,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674781780]
[2025-02-05 11:37:24,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:24,466 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:24,467 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:24,471 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:37:24,472 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:37:24,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes.
[2025-02-05 11:37:24,582 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements.
[2025-02-05 11:37:24,582 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:24,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:24,584 INFO  L256         TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:24,594 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:24,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 492 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked.
[2025-02-05 11:37:24,640 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:24,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [674781780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:24,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:24,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-02-05 11:37:24,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13893842]
[2025-02-05 11:37:24,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:24,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:24,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:24,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:24,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:37:24,642 INFO  L87              Difference]: Start difference. First operand 71349 states and 78939 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:27,024 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:27,025 INFO  L93              Difference]: Finished difference Result 160720 states and 178455 transitions.
[2025-02-05 11:37:27,025 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:27,025 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 409
[2025-02-05 11:37:27,026 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:27,260 INFO  L225             Difference]: With dead ends: 160720
[2025-02-05 11:37:27,261 INFO  L226             Difference]: Without dead ends: 90124
[2025-02-05 11:37:27,292 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:37:27,293 INFO  L435           NwaCegarLoop]: 1109 mSDtfsCounter, 862 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:27,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1117 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:37:27,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90124 states.
[2025-02-05 11:37:28,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90124 to 84116.
[2025-02-05 11:37:28,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84116 states, 84115 states have (on average 1.104618676811508) internal successors, (92915), 84115 states have internal predecessors, (92915), 0 states have call successors, (0), 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:28,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 92915 transitions.
[2025-02-05 11:37:28,207 INFO  L78                 Accepts]: Start accepts. Automaton has 84116 states and 92915 transitions. Word has length 409
[2025-02-05 11:37:28,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:28,208 INFO  L471      AbstractCegarLoop]: Abstraction has 84116 states and 92915 transitions.
[2025-02-05 11:37:28,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:28,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 84116 states and 92915 transitions.
[2025-02-05 11:37:28,212 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 412
[2025-02-05 11:37:28,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:28,212 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:28,218 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 11:37:28,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-02-05 11:37:28,413 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:28,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:28,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 987951884, now seen corresponding path program 1 times
[2025-02-05 11:37:28,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:28,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346090299]
[2025-02-05 11:37:28,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:28,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:28,432 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes.
[2025-02-05 11:37:28,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements.
[2025-02-05 11:37:28,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:28,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:28,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 498 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked.
[2025-02-05 11:37:28,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:28,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346090299]
[2025-02-05 11:37:28,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346090299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:28,597 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:28,597 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:28,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086155860]
[2025-02-05 11:37:28,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:28,597 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:28,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:28,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:28,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:28,599 INFO  L87              Difference]: Start difference. First operand 84116 states and 92915 transitions. Second operand  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:31,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:31,591 INFO  L93              Difference]: Finished difference Result 205780 states and 228532 transitions.
[2025-02-05 11:37:31,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:31,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 411
[2025-02-05 11:37:31,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:31,740 INFO  L225             Difference]: With dead ends: 205780
[2025-02-05 11:37:31,740 INFO  L226             Difference]: Without dead ends: 122417
[2025-02-05 11:37:31,761 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:31,762 INFO  L435           NwaCegarLoop]: 1286 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:31,762 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1293 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:31,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122417 states.
[2025-02-05 11:37:32,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122417 to 111152.
[2025-02-05 11:37:32,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111152 states, 111151 states have (on average 1.0923158586067603) internal successors, (121412), 111151 states have internal predecessors, (121412), 0 states have call successors, (0), 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:32,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111152 states to 111152 states and 121412 transitions.
[2025-02-05 11:37:32,694 INFO  L78                 Accepts]: Start accepts. Automaton has 111152 states and 121412 transitions. Word has length 411
[2025-02-05 11:37:32,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:32,695 INFO  L471      AbstractCegarLoop]: Abstraction has 111152 states and 121412 transitions.
[2025-02-05 11:37:32,695 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:32,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 111152 states and 121412 transitions.
[2025-02-05 11:37:32,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 545
[2025-02-05 11:37:32,704 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:32,704 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,704 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:37:32,705 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:32,705 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:32,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -327297180, now seen corresponding path program 1 times
[2025-02-05 11:37:32,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:32,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064659892]
[2025-02-05 11:37:32,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:32,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:32,731 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes.
[2025-02-05 11:37:32,747 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements.
[2025-02-05 11:37:32,747 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:32,747 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:33,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 654 backedges. 368 proven. 108 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked.
[2025-02-05 11:37:33,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:33,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064659892]
[2025-02-05 11:37:33,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064659892] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:37:33,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244869718]
[2025-02-05 11:37:33,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:33,438 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:33,438 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:37:33,440 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:37:33,448 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:37:33,505 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes.
[2025-02-05 11:37:33,577 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements.
[2025-02-05 11:37:33,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:33,577 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:33,579 INFO  L256         TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:37:33,587 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:37:34,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 654 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked.
[2025-02-05 11:37:34,018 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:37:34,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [244869718] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:34,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:37:34,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:37:34,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46368792]
[2025-02-05 11:37:34,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:34,018 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:34,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:34,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:34,023 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:37:34,023 INFO  L87              Difference]: Start difference. First operand 111152 states and 121412 transitions. Second operand  has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 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:36,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:36,908 INFO  L93              Difference]: Finished difference Result 221551 states and 242066 transitions.
[2025-02-05 11:37:36,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:36,909 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 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 544
[2025-02-05 11:37:36,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:37,069 INFO  L225             Difference]: With dead ends: 221551
[2025-02-05 11:37:37,070 INFO  L226             Difference]: Without dead ends: 111152
[2025-02-05 11:37:37,137 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 543 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:37,137 INFO  L435           NwaCegarLoop]: 382 mSDtfsCounter, 671 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:37,138 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 389 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:37:37,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 111152 states.
[2025-02-05 11:37:38,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 111152 to 109650.
[2025-02-05 11:37:38,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 109650 states, 109649 states have (on average 1.0715191201014145) internal successors, (117491), 109649 states have internal predecessors, (117491), 0 states have call successors, (0), 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:38,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 109650 states to 109650 states and 117491 transitions.
[2025-02-05 11:37:38,471 INFO  L78                 Accepts]: Start accepts. Automaton has 109650 states and 117491 transitions. Word has length 544
[2025-02-05 11:37:38,471 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:38,471 INFO  L471      AbstractCegarLoop]: Abstraction has 109650 states and 117491 transitions.
[2025-02-05 11:37:38,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 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:38,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 109650 states and 117491 transitions.
[2025-02-05 11:37:38,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 548
[2025-02-05 11:37:38,480 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:38,481 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:37:38,487 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:37:38,681 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:37:38,681 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:38,682 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:38,682 INFO  L85        PathProgramCache]: Analyzing trace with hash 1722475834, now seen corresponding path program 1 times
[2025-02-05 11:37:38,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:38,682 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72324838]
[2025-02-05 11:37:38,682 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:38,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:38,712 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes.
[2025-02-05 11:37:38,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements.
[2025-02-05 11:37:38,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:38,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:38,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 676 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-02-05 11:37:38,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:38,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72324838]
[2025-02-05 11:37:38,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72324838] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:38,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:38,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:38,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438657002]
[2025-02-05 11:37:38,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:38,869 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:38,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:38,869 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:38,869 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:38,869 INFO  L87              Difference]: Start difference. First operand 109650 states and 117491 transitions. Second operand  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:41,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:41,228 INFO  L93              Difference]: Finished difference Result 242579 states and 261399 transitions.
[2025-02-05 11:37:41,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:41,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 547
[2025-02-05 11:37:41,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:41,375 INFO  L225             Difference]: With dead ends: 242579
[2025-02-05 11:37:41,375 INFO  L226             Difference]: Without dead ends: 133682
[2025-02-05 11:37:41,438 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:41,439 INFO  L435           NwaCegarLoop]: 1247 mSDtfsCounter, 679 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:41,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1255 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:37:41,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133682 states.
[2025-02-05 11:37:42,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 128425.
[2025-02-05 11:37:42,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128425 states, 128424 states have (on average 1.0635239519093005) internal successors, (136582), 128424 states have internal predecessors, (136582), 0 states have call successors, (0), 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:43,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128425 states to 128425 states and 136582 transitions.
[2025-02-05 11:37:43,062 INFO  L78                 Accepts]: Start accepts. Automaton has 128425 states and 136582 transitions. Word has length 547
[2025-02-05 11:37:43,063 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:43,063 INFO  L471      AbstractCegarLoop]: Abstraction has 128425 states and 136582 transitions.
[2025-02-05 11:37:43,063 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:43,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 128425 states and 136582 transitions.
[2025-02-05 11:37:43,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 563
[2025-02-05 11:37:43,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:43,075 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:37:43,075 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:43,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:43,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -815659073, now seen corresponding path program 1 times
[2025-02-05 11:37:43,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:43,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211950144]
[2025-02-05 11:37:43,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:43,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:43,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes.
[2025-02-05 11:37:43,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements.
[2025-02-05 11:37:43,145 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:43,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:43,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 710 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked.
[2025-02-05 11:37:43,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:43,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211950144]
[2025-02-05 11:37:43,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211950144] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:43,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:43,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:43,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584913040]
[2025-02-05 11:37:43,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:43,338 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:43,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:43,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:43,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:43,339 INFO  L87              Difference]: Start difference. First operand 128425 states and 136582 transitions. Second operand  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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:46,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:46,190 INFO  L93              Difference]: Finished difference Result 269615 states and 286263 transitions.
[2025-02-05 11:37:46,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:46,198 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 562
[2025-02-05 11:37:46,198 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:46,366 INFO  L225             Difference]: With dead ends: 269615
[2025-02-05 11:37:46,366 INFO  L226             Difference]: Without dead ends: 141943
[2025-02-05 11:37:46,435 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:46,435 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 722 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:46,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 197 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 11:37:46,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141943 states.
[2025-02-05 11:37:47,755 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141943 to 129927.
[2025-02-05 11:37:47,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129927 states, 129926 states have (on average 1.0597416991210382) internal successors, (137688), 129926 states have internal predecessors, (137688), 0 states have call successors, (0), 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:47,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129927 states to 129927 states and 137688 transitions.
[2025-02-05 11:37:47,935 INFO  L78                 Accepts]: Start accepts. Automaton has 129927 states and 137688 transitions. Word has length 562
[2025-02-05 11:37:47,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:47,939 INFO  L471      AbstractCegarLoop]: Abstraction has 129927 states and 137688 transitions.
[2025-02-05 11:37:47,940 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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:47,940 INFO  L276                IsEmpty]: Start isEmpty. Operand 129927 states and 137688 transitions.
[2025-02-05 11:37:47,949 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 566
[2025-02-05 11:37:47,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:47,949 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:37:47,950 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:37:47,950 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:47,950 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:47,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1211137939, now seen corresponding path program 1 times
[2025-02-05 11:37:47,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:47,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572844640]
[2025-02-05 11:37:47,950 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:47,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:48,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes.
[2025-02-05 11:37:48,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements.
[2025-02-05 11:37:48,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:48,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:48,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 765 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2025-02-05 11:37:48,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:48,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572844640]
[2025-02-05 11:37:48,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572844640] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:48,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:48,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:48,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160237982]
[2025-02-05 11:37:48,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:48,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:48,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:48,574 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:48,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:48,574 INFO  L87              Difference]: Start difference. First operand 129927 states and 137688 transitions. Second operand  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:51,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:51,350 INFO  L93              Difference]: Finished difference Result 267362 states and 283116 transitions.
[2025-02-05 11:37:51,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:51,350 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 565
[2025-02-05 11:37:51,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:51,526 INFO  L225             Difference]: With dead ends: 267362
[2025-02-05 11:37:51,526 INFO  L226             Difference]: Without dead ends: 138188
[2025-02-05 11:37:51,607 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:51,608 INFO  L435           NwaCegarLoop]: 1248 mSDtfsCounter, 591 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:51,608 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1256 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:37:51,905 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138188 states.
[2025-02-05 11:37:52,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138188 to 136686.
[2025-02-05 11:37:53,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136686 states, 136685 states have (on average 1.0570216190511028) internal successors, (144479), 136685 states have internal predecessors, (144479), 0 states have call successors, (0), 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:53,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136686 states to 136686 states and 144479 transitions.
[2025-02-05 11:37:53,124 INFO  L78                 Accepts]: Start accepts. Automaton has 136686 states and 144479 transitions. Word has length 565
[2025-02-05 11:37:53,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:53,125 INFO  L471      AbstractCegarLoop]: Abstraction has 136686 states and 144479 transitions.
[2025-02-05 11:37:53,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:53,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 136686 states and 144479 transitions.
[2025-02-05 11:37:53,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 603
[2025-02-05 11:37:53,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:53,135 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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]
[2025-02-05 11:37:53,136 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 11:37:53,136 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:53,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:53,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -633722597, now seen corresponding path program 1 times
[2025-02-05 11:37:53,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:53,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861952537]
[2025-02-05 11:37:53,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:53,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:53,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-02-05 11:37:53,180 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-02-05 11:37:53,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:53,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:53,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 876 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked.
[2025-02-05 11:37:53,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:53,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861952537]
[2025-02-05 11:37:53,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861952537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:53,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:53,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:53,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571302507]
[2025-02-05 11:37:53,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:53,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:53,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:53,682 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:53,682 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:53,682 INFO  L87              Difference]: Start difference. First operand 136686 states and 144479 transitions. Second operand  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:37:55,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:37:55,959 INFO  L93              Difference]: Finished difference Result 276374 states and 292023 transitions.
[2025-02-05 11:37:55,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:37:55,959 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 602
[2025-02-05 11:37:55,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:37:56,382 INFO  L225             Difference]: With dead ends: 276374
[2025-02-05 11:37:56,382 INFO  L226             Difference]: Without dead ends: 140441
[2025-02-05 11:37:56,422 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:56,423 INFO  L435           NwaCegarLoop]: 1225 mSDtfsCounter, 603 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:37:56,423 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1233 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:37:56,461 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140441 states.
[2025-02-05 11:37:57,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140441 to 136686.
[2025-02-05 11:37:57,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136686 states, 136685 states have (on average 1.0560997914913852) internal successors, (144353), 136685 states have internal predecessors, (144353), 0 states have call successors, (0), 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:57,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136686 states to 136686 states and 144353 transitions.
[2025-02-05 11:37:57,652 INFO  L78                 Accepts]: Start accepts. Automaton has 136686 states and 144353 transitions. Word has length 602
[2025-02-05 11:37:57,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:37:57,653 INFO  L471      AbstractCegarLoop]: Abstraction has 136686 states and 144353 transitions.
[2025-02-05 11:37:57,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:57,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 136686 states and 144353 transitions.
[2025-02-05 11:37:57,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 620
[2025-02-05 11:37:57,664 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:37:57,665 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:37:57,665 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 11:37:57,665 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:37:57,665 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:37:57,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -1983042908, now seen corresponding path program 1 times
[2025-02-05 11:37:57,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:37:57,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066124111]
[2025-02-05 11:37:57,665 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:37:57,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:37:57,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes.
[2025-02-05 11:37:57,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements.
[2025-02-05 11:37:57,735 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:37:57,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:37:57,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 898 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked.
[2025-02-05 11:37:57,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:37:57,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066124111]
[2025-02-05 11:37:57,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066124111] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:37:57,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:37:57,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:37:57,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187037585]
[2025-02-05 11:37:57,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:37:57,993 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:37:57,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:37:57,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:37:57,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:37:57,993 INFO  L87              Difference]: Start difference. First operand 136686 states and 144353 transitions. Second operand  has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:00,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:38:00,670 INFO  L93              Difference]: Finished difference Result 272619 states and 287948 transitions.
[2025-02-05 11:38:00,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:38:00,671 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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 619
[2025-02-05 11:38:00,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:38:00,820 INFO  L225             Difference]: With dead ends: 272619
[2025-02-05 11:38:00,821 INFO  L226             Difference]: Without dead ends: 136686
[2025-02-05 11:38:00,892 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:00,892 INFO  L435           NwaCegarLoop]: 1193 mSDtfsCounter, 695 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:38:00,893 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1201 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:38:00,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136686 states.
[2025-02-05 11:38:01,981 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136686 to 134433.
[2025-02-05 11:38:02,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134433 states, 134432 states have (on average 1.0483069507260177) internal successors, (140926), 134432 states have internal predecessors, (140926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:02,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134433 states to 134433 states and 140926 transitions.
[2025-02-05 11:38:02,496 INFO  L78                 Accepts]: Start accepts. Automaton has 134433 states and 140926 transitions. Word has length 619
[2025-02-05 11:38:02,496 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:38:02,497 INFO  L471      AbstractCegarLoop]: Abstraction has 134433 states and 140926 transitions.
[2025-02-05 11:38:02,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:38:02,497 INFO  L276                IsEmpty]: Start isEmpty. Operand 134433 states and 140926 transitions.
[2025-02-05 11:38:02,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 655
[2025-02-05 11:38:02,506 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:38:02,506 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:38:02,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 11:38:02,507 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:38:02,507 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:38:02,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 187120898, now seen corresponding path program 1 times
[2025-02-05 11:38:02,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:38:02,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597100548]
[2025-02-05 11:38:02,507 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:38:02,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:38:02,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes.
[2025-02-05 11:38:02,561 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements.
[2025-02-05 11:38:02,561 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:38:02,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:38:02,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 1077 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked.
[2025-02-05 11:38:02,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:38:02,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597100548]
[2025-02-05 11:38:02,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597100548] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:38:02,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:38:02,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:38:02,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599881743]
[2025-02-05 11:38:02,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:38:02,987 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:38:02,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:38:02,987 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:38:02,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:38:02,987 INFO  L87              Difference]: Start difference. First operand 134433 states and 140926 transitions. Second operand  has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)