./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label26.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label26.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 01:42:09,869 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 01:42:09,914 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 01:42:09,917 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 01:42:09,919 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 01:42:09,936 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 01:42:09,938 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 01:42:09,938 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 01:42:09,939 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 01:42:09,939 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 01:42:09,940 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 01:42:09,940 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 01:42:09,940 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 01:42:09,940 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 01:42:09,940 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 01:42:09,941 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 01:42:09,941 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 01:42:09,942 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:42:09,942 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 01:42:09,942 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 01:42:09,943 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 01:42:09,943 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/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 -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076
[2025-03-08 01:42:10,140 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 01:42:10,145 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 01:42:10,147 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 01:42:10,147 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 01:42:10,147 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 01:42:10,149 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label26.c
[2025-03-08 01:42:11,272 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342ce04f/ac792993713241899e09befd77c57567/FLAG084338560
[2025-03-08 01:42:11,565 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 01:42:11,566 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c
[2025-03-08 01:42:11,579 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342ce04f/ac792993713241899e09befd77c57567/FLAG084338560
[2025-03-08 01:42:11,846 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342ce04f/ac792993713241899e09befd77c57567
[2025-03-08 01:42:11,849 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 01:42:11,850 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 01:42:11,851 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 01:42:11,851 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 01:42:11,854 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 01:42:11,855 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:11" (1/1) ...
[2025-03-08 01:42:11,855 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3ae3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:11, skipping insertion in model container
[2025-03-08 01:42:11,855 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:11" (1/1) ...
[2025-03-08 01:42:11,890 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 01:42:12,029 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c[5699,5712]
[2025-03-08 01:42:12,215 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:42:12,222 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 01:42:12,242 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c[5699,5712]
[2025-03-08 01:42:12,361 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:42:12,375 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 01:42:12,376 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12 WrapperNode
[2025-03-08 01:42:12,376 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 01:42:12,377 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 01:42:12,377 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 01:42:12,377 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 01:42:12,381 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,405 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,481 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997
[2025-03-08 01:42:12,481 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 01:42:12,482 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 01:42:12,482 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 01:42:12,482 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 01:42:12,488 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,488 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,499 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,581 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-03-08 01:42:12,582 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,582 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,623 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,627 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,635 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,641 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,652 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 01:42:12,653 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 01:42:12,654 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 01:42:12,654 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 01:42:12,655 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (1/1) ...
[2025-03-08 01:42:12,659 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:42:12,668 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:12,679 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 01:42:12,681 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 01:42:12,700 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 01:42:12,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 01:42:12,700 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 01:42:12,700 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 01:42:12,750 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 01:42:12,751 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 01:42:13,950 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2025-03-08 01:42:13,950 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 01:42:13,964 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 01:42:13,965 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 01:42:13,965 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:13 BoogieIcfgContainer
[2025-03-08 01:42:13,966 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 01:42:13,968 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 01:42:13,968 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 01:42:13,972 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 01:42:13,972 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:42:11" (1/3) ...
[2025-03-08 01:42:13,972 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792fa35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:13, skipping insertion in model container
[2025-03-08 01:42:13,973 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:12" (2/3) ...
[2025-03-08 01:42:13,973 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792fa35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:13, skipping insertion in model container
[2025-03-08 01:42:13,973 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:13" (3/3) ...
[2025-03-08 01:42:13,975 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem11_label26.c
[2025-03-08 01:42:13,986 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 01:42:13,987 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label26.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 01:42:14,055 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 01:42:14,065 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;@6a88f1d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 01:42:14,065 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 01:42:14,068 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:14,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-03-08 01:42:14,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:14,073 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:14,073 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:14,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:14,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 7551524, now seen corresponding path program 1 times
[2025-03-08 01:42:14,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:14,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044045311]
[2025-03-08 01:42:14,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:14,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:14,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-03-08 01:42:14,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-03-08 01:42:14,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:14,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:14,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:14,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:14,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044045311]
[2025-03-08 01:42:14,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044045311] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:14,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:14,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:14,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238462347]
[2025-03-08 01:42:14,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:14,326 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:14,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:14,338 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:14,338 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:14,340 INFO  L87              Difference]: Start difference. First operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:15,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:15,217 INFO  L93              Difference]: Finished difference Result 769 states and 1357 transitions.
[2025-03-08 01:42:15,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:15,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39
[2025-03-08 01:42:15,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:15,230 INFO  L225             Difference]: With dead ends: 769
[2025-03-08 01:42:15,230 INFO  L226             Difference]: Without dead ends: 422
[2025-03-08 01:42:15,234 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:15,239 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 201 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:15,239 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 01:42:15,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 422 states.
[2025-03-08 01:42:15,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412.
[2025-03-08 01:42:15,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:15,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions.
[2025-03-08 01:42:15,280 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 39
[2025-03-08 01:42:15,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:15,280 INFO  L471      AbstractCegarLoop]: Abstraction has 412 states and 626 transitions.
[2025-03-08 01:42:15,281 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:15,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions.
[2025-03-08 01:42:15,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 01:42:15,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:15,283 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:15,283 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 01:42:15,283 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:15,284 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:15,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 1220079625, now seen corresponding path program 1 times
[2025-03-08 01:42:15,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:15,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350221830]
[2025-03-08 01:42:15,284 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:15,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:15,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 01:42:15,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 01:42:15,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:15,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:15,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:15,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:15,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350221830]
[2025-03-08 01:42:15,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350221830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:15,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:15,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:15,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413723483]
[2025-03-08 01:42:15,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:15,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:15,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:15,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:15,510 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:15,510 INFO  L87              Difference]: Start difference. First operand 412 states and 626 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:16,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:16,185 INFO  L93              Difference]: Finished difference Result 1199 states and 1829 transitions.
[2025-03-08 01:42:16,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:16,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105
[2025-03-08 01:42:16,186 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:16,188 INFO  L225             Difference]: With dead ends: 1199
[2025-03-08 01:42:16,189 INFO  L226             Difference]: Without dead ends: 789
[2025-03-08 01:42:16,189 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-03-08 01:42:16,190 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:16,190 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:16,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 789 states.
[2025-03-08 01:42:16,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789.
[2025-03-08 01:42:16,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:16,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions.
[2025-03-08 01:42:16,215 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 105
[2025-03-08 01:42:16,215 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:16,215 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions.
[2025-03-08 01:42:16,215 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:16,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions.
[2025-03-08 01:42:16,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 01:42:16,217 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:16,218 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:16,218 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 01:42:16,218 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:16,218 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:16,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 487046739, now seen corresponding path program 1 times
[2025-03-08 01:42:16,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:16,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416022888]
[2025-03-08 01:42:16,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:16,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:16,234 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 01:42:16,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 01:42:16,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:16,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:16,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:16,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:16,474 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416022888]
[2025-03-08 01:42:16,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416022888] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:16,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:16,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:16,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117128607]
[2025-03-08 01:42:16,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:16,476 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:16,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:16,477 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:16,477 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:16,477 INFO  L87              Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,075 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:17,075 INFO  L93              Difference]: Finished difference Result 2314 states and 3181 transitions.
[2025-03-08 01:42:17,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:17,076 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109
[2025-03-08 01:42:17,076 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:17,081 INFO  L225             Difference]: With dead ends: 2314
[2025-03-08 01:42:17,081 INFO  L226             Difference]: Without dead ends: 1527
[2025-03-08 01:42:17,082 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-03-08 01:42:17,083 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:17,083 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:17,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1527 states.
[2025-03-08 01:42:17,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526.
[2025-03-08 01:42:17,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions.
[2025-03-08 01:42:17,108 INFO  L78                 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 109
[2025-03-08 01:42:17,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:17,108 INFO  L471      AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions.
[2025-03-08 01:42:17,108 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,108 INFO  L276                IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions.
[2025-03-08 01:42:17,111 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-03-08 01:42:17,111 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:17,111 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:17,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 01:42:17,111 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:17,112 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:17,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730480094, now seen corresponding path program 1 times
[2025-03-08 01:42:17,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:17,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251290308]
[2025-03-08 01:42:17,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:17,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:17,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-08 01:42:17,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-08 01:42:17,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:17,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:17,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:17,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:17,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251290308]
[2025-03-08 01:42:17,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251290308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:17,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:17,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:17,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962479905]
[2025-03-08 01:42:17,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:17,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:17,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:17,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:17,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:17,331 INFO  L87              Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:17,947 INFO  L93              Difference]: Finished difference Result 3614 states and 4469 transitions.
[2025-03-08 01:42:17,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:17,947 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166
[2025-03-08 01:42:17,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:17,956 INFO  L225             Difference]: With dead ends: 3614
[2025-03-08 01:42:17,956 INFO  L226             Difference]: Without dead ends: 2274
[2025-03-08 01:42:17,958 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-03-08 01:42:17,961 INFO  L435           NwaCegarLoop]: 315 mSDtfsCounter, 166 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:17,962 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:17,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2274 states.
[2025-03-08 01:42:17,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897.
[2025-03-08 01:42:17,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1897 states, 1896 states have (on average 1.215717299578059) internal successors, (2305), 1896 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2305 transitions.
[2025-03-08 01:42:17,995 INFO  L78                 Accepts]: Start accepts. Automaton has 1897 states and 2305 transitions. Word has length 166
[2025-03-08 01:42:17,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:17,996 INFO  L471      AbstractCegarLoop]: Abstraction has 1897 states and 2305 transitions.
[2025-03-08 01:42:17,997 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:17,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 1897 states and 2305 transitions.
[2025-03-08 01:42:17,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-08 01:42:17,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:18,000 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:18,000 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 01:42:18,000 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:18,001 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:18,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1663218837, now seen corresponding path program 1 times
[2025-03-08 01:42:18,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:18,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300562984]
[2025-03-08 01:42:18,001 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:18,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:18,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 01:42:18,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 01:42:18,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:18,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:18,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-03-08 01:42:18,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:18,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300562984]
[2025-03-08 01:42:18,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300562984] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:18,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:18,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:18,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708920310]
[2025-03-08 01:42:18,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:18,259 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:18,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:18,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:18,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:18,260 INFO  L87              Difference]: Start difference. First operand 1897 states and 2305 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:18,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:18,872 INFO  L93              Difference]: Finished difference Result 4897 states and 6068 transitions.
[2025-03-08 01:42:18,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:18,873 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 221
[2025-03-08 01:42:18,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:18,881 INFO  L225             Difference]: With dead ends: 4897
[2025-03-08 01:42:18,881 INFO  L226             Difference]: Without dead ends: 3002
[2025-03-08 01:42:18,883 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-03-08 01:42:18,884 INFO  L435           NwaCegarLoop]: 313 mSDtfsCounter, 173 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:18,884 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 338 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:18,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3002 states.
[2025-03-08 01:42:18,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002.
[2025-03-08 01:42:18,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3002 states, 3001 states have (on average 1.1919360213262247) internal successors, (3577), 3001 states have internal predecessors, (3577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:18,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3577 transitions.
[2025-03-08 01:42:18,927 INFO  L78                 Accepts]: Start accepts. Automaton has 3002 states and 3577 transitions. Word has length 221
[2025-03-08 01:42:18,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:18,927 INFO  L471      AbstractCegarLoop]: Abstraction has 3002 states and 3577 transitions.
[2025-03-08 01:42:18,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:18,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 3002 states and 3577 transitions.
[2025-03-08 01:42:18,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2025-03-08 01:42:18,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:18,931 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 01:42:18,931 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 01:42:18,931 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:18,932 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:18,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 1898107729, now seen corresponding path program 1 times
[2025-03-08 01:42:18,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:18,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397934343]
[2025-03-08 01:42:18,932 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:18,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:18,954 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes.
[2025-03-08 01:42:18,992 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements.
[2025-03-08 01:42:18,993 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:18,993 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:19,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2025-03-08 01:42:19,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:19,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397934343]
[2025-03-08 01:42:19,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397934343] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:19,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:19,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:19,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036933801]
[2025-03-08 01:42:19,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:19,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:19,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:19,150 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:19,150 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:19,150 INFO  L87              Difference]: Start difference. First operand 3002 states and 3577 transitions. Second operand  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:19,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:19,775 INFO  L93              Difference]: Finished difference Result 6558 states and 7936 transitions.
[2025-03-08 01:42:19,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:19,775 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 269
[2025-03-08 01:42:19,776 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:19,785 INFO  L225             Difference]: With dead ends: 6558
[2025-03-08 01:42:19,785 INFO  L226             Difference]: Without dead ends: 3558
[2025-03-08 01:42:19,788 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-03-08 01:42:19,789 INFO  L435           NwaCegarLoop]: 361 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:19,789 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 383 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:19,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3558 states.
[2025-03-08 01:42:19,842 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3553.
[2025-03-08 01:42:19,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3553 states, 3552 states have (on average 1.1905968468468469) internal successors, (4229), 3552 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:19,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4229 transitions.
[2025-03-08 01:42:19,853 INFO  L78                 Accepts]: Start accepts. Automaton has 3553 states and 4229 transitions. Word has length 269
[2025-03-08 01:42:19,853 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:19,853 INFO  L471      AbstractCegarLoop]: Abstraction has 3553 states and 4229 transitions.
[2025-03-08 01:42:19,853 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:19,854 INFO  L276                IsEmpty]: Start isEmpty. Operand 3553 states and 4229 transitions.
[2025-03-08 01:42:19,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 302
[2025-03-08 01:42:19,858 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:19,858 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:19,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 01:42:19,858 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:19,859 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:19,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 2121509508, now seen corresponding path program 1 times
[2025-03-08 01:42:19,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:19,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37786131]
[2025-03-08 01:42:19,859 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:19,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:19,892 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes.
[2025-03-08 01:42:19,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements.
[2025-03-08 01:42:19,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:19,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:20,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-03-08 01:42:20,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:20,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37786131]
[2025-03-08 01:42:20,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37786131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:20,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:20,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:20,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405196147]
[2025-03-08 01:42:20,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:20,026 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:20,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:20,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:20,027 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:20,027 INFO  L87              Difference]: Start difference. First operand 3553 states and 4229 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-03-08 01:42:20,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:20,592 INFO  L93              Difference]: Finished difference Result 8574 states and 10383 transitions.
[2025-03-08 01:42:20,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:20,593 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 301
[2025-03-08 01:42:20,593 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:20,609 INFO  L225             Difference]: With dead ends: 8574
[2025-03-08 01:42:20,610 INFO  L226             Difference]: Without dead ends: 5023
[2025-03-08 01:42:20,614 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-03-08 01:42:20,615 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:20,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 152 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:20,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5023 states.
[2025-03-08 01:42:20,676 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5021.
[2025-03-08 01:42:20,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5021 states, 5020 states have (on average 1.1741035856573705) internal successors, (5894), 5020 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:20,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 5894 transitions.
[2025-03-08 01:42:20,694 INFO  L78                 Accepts]: Start accepts. Automaton has 5021 states and 5894 transitions. Word has length 301
[2025-03-08 01:42:20,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:20,695 INFO  L471      AbstractCegarLoop]: Abstraction has 5021 states and 5894 transitions.
[2025-03-08 01:42:20,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-03-08 01:42:20,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 5021 states and 5894 transitions.
[2025-03-08 01:42:20,703 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-03-08 01:42:20,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:20,703 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:20,703 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 01:42:20,703 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:20,704 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:20,704 INFO  L85        PathProgramCache]: Analyzing trace with hash -1377568029, now seen corresponding path program 1 times
[2025-03-08 01:42:20,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:20,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249370165]
[2025-03-08 01:42:20,704 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:20,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:20,761 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-03-08 01:42:20,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-03-08 01:42:20,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:20,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:20,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 382 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked.
[2025-03-08 01:42:20,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:20,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249370165]
[2025-03-08 01:42:20,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249370165] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:20,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:20,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:20,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427567490]
[2025-03-08 01:42:20,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:20,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:20,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:20,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:20,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:20,903 INFO  L87              Difference]: Start difference. First operand 5021 states and 5894 transitions. Second operand  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:21,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:21,493 INFO  L93              Difference]: Finished difference Result 11145 states and 13224 transitions.
[2025-03-08 01:42:21,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:21,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359
[2025-03-08 01:42:21,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:21,510 INFO  L225             Difference]: With dead ends: 11145
[2025-03-08 01:42:21,510 INFO  L226             Difference]: Without dead ends: 6126
[2025-03-08 01:42:21,516 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-03-08 01:42:21,516 INFO  L435           NwaCegarLoop]: 134 mSDtfsCounter, 168 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:21,516 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 157 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:21,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6126 states.
[2025-03-08 01:42:21,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 6124.
[2025-03-08 01:42:21,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6124 states, 6123 states have (on average 1.1660950514453698) internal successors, (7140), 6123 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:21,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7140 transitions.
[2025-03-08 01:42:21,621 INFO  L78                 Accepts]: Start accepts. Automaton has 6124 states and 7140 transitions. Word has length 359
[2025-03-08 01:42:21,621 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:21,621 INFO  L471      AbstractCegarLoop]: Abstraction has 6124 states and 7140 transitions.
[2025-03-08 01:42:21,621 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:21,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 6124 states and 7140 transitions.
[2025-03-08 01:42:21,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-03-08 01:42:21,629 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:21,630 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 01:42:21,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 01:42:21,630 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:21,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:21,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1514884305, now seen corresponding path program 1 times
[2025-03-08 01:42:21,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:21,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85733614]
[2025-03-08 01:42:21,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:21,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:21,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-03-08 01:42:21,683 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-03-08 01:42:21,684 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:21,684 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:21,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-08 01:42:21,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:21,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85733614]
[2025-03-08 01:42:21,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85733614] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:21,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:21,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:21,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115232850]
[2025-03-08 01:42:21,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:21,834 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:21,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:21,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:21,835 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:21,835 INFO  L87              Difference]: Start difference. First operand 6124 states and 7140 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:22,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:22,142 INFO  L93              Difference]: Finished difference Result 12242 states and 14274 transitions.
[2025-03-08 01:42:22,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:22,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 379
[2025-03-08 01:42:22,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:22,177 INFO  L225             Difference]: With dead ends: 12242
[2025-03-08 01:42:22,178 INFO  L226             Difference]: Without dead ends: 6120
[2025-03-08 01:42:22,181 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-03-08 01:42:22,182 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:22,182 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:42:22,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6120 states.
[2025-03-08 01:42:22,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6120.
[2025-03-08 01:42:22,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6120 states, 6119 states have (on average 1.1655499264585716) internal successors, (7132), 6119 states have internal predecessors, (7132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:22,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 7132 transitions.
[2025-03-08 01:42:22,258 INFO  L78                 Accepts]: Start accepts. Automaton has 6120 states and 7132 transitions. Word has length 379
[2025-03-08 01:42:22,259 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:22,259 INFO  L471      AbstractCegarLoop]: Abstraction has 6120 states and 7132 transitions.
[2025-03-08 01:42:22,259 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:22,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 6120 states and 7132 transitions.
[2025-03-08 01:42:22,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 412
[2025-03-08 01:42:22,269 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:22,270 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:22,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 01:42:22,270 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:22,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:22,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 1763455160, now seen corresponding path program 1 times
[2025-03-08 01:42:22,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:22,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385786172]
[2025-03-08 01:42:22,271 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:22,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:22,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes.
[2025-03-08 01:42:22,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements.
[2025-03-08 01:42:22,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:22,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:22,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-03-08 01:42:22,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:22,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385786172]
[2025-03-08 01:42:22,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385786172] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:22,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:22,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:22,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750135806]
[2025-03-08 01:42:22,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:22,558 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:22,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:22,559 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:22,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:22,560 INFO  L87              Difference]: Start difference. First operand 6120 states and 7132 transitions. Second operand  has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:23,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:23,518 INFO  L93              Difference]: Finished difference Result 16664 states and 19274 transitions.
[2025-03-08 01:42:23,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:23,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-03-08 01:42:23,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:23,537 INFO  L225             Difference]: With dead ends: 16664
[2025-03-08 01:42:23,537 INFO  L226             Difference]: Without dead ends: 10546
[2025-03-08 01:42:23,544 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-03-08 01:42:23,544 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 189 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:23,545 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 67 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 01:42:23,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10546 states.
[2025-03-08 01:42:23,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10546 to 10546.
[2025-03-08 01:42:23,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10546 states, 10545 states have (on average 1.1465149359886202) internal successors, (12090), 10545 states have internal predecessors, (12090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:23,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10546 states to 10546 states and 12090 transitions.
[2025-03-08 01:42:23,667 INFO  L78                 Accepts]: Start accepts. Automaton has 10546 states and 12090 transitions. Word has length 411
[2025-03-08 01:42:23,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:23,668 INFO  L471      AbstractCegarLoop]: Abstraction has 10546 states and 12090 transitions.
[2025-03-08 01:42:23,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:23,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 10546 states and 12090 transitions.
[2025-03-08 01:42:23,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 441
[2025-03-08 01:42:23,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:23,684 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:23,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 01:42:23,684 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:23,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:23,685 INFO  L85        PathProgramCache]: Analyzing trace with hash -1579457361, now seen corresponding path program 1 times
[2025-03-08 01:42:23,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:23,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908370623]
[2025-03-08 01:42:23,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:23,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:23,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes.
[2025-03-08 01:42:23,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements.
[2025-03-08 01:42:23,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:23,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:23,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 439 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked.
[2025-03-08 01:42:23,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:23,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908370623]
[2025-03-08 01:42:23,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908370623] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:23,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:23,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:23,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839068550]
[2025-03-08 01:42:23,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:23,870 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:23,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:23,871 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:23,871 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:23,871 INFO  L87              Difference]: Start difference. First operand 10546 states and 12090 transitions. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:24,416 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:24,416 INFO  L93              Difference]: Finished difference Result 19428 states and 22359 transitions.
[2025-03-08 01:42:24,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:24,416 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440
[2025-03-08 01:42:24,417 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:24,432 INFO  L225             Difference]: With dead ends: 19428
[2025-03-08 01:42:24,433 INFO  L226             Difference]: Without dead ends: 10544
[2025-03-08 01:42:24,440 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-03-08 01:42:24,441 INFO  L435           NwaCegarLoop]: 276 mSDtfsCounter, 57 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:24,441 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 294 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:24,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10544 states.
[2025-03-08 01:42:24,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10544 to 10544.
[2025-03-08 01:42:24,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10544 states, 10543 states have (on average 1.1263397514938822) internal successors, (11875), 10543 states have internal predecessors, (11875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:24,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10544 states to 10544 states and 11875 transitions.
[2025-03-08 01:42:24,545 INFO  L78                 Accepts]: Start accepts. Automaton has 10544 states and 11875 transitions. Word has length 440
[2025-03-08 01:42:24,546 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:24,546 INFO  L471      AbstractCegarLoop]: Abstraction has 10544 states and 11875 transitions.
[2025-03-08 01:42:24,546 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:24,546 INFO  L276                IsEmpty]: Start isEmpty. Operand 10544 states and 11875 transitions.
[2025-03-08 01:42:24,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2025-03-08 01:42:24,558 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:24,558 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:24,558 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 01:42:24,558 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:24,559 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:24,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -234968124, now seen corresponding path program 1 times
[2025-03-08 01:42:24,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:24,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471035410]
[2025-03-08 01:42:24,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:24,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:24,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes.
[2025-03-08 01:42:24,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements.
[2025-03-08 01:42:24,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:24,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:24,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 702 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked.
[2025-03-08 01:42:24,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:24,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471035410]
[2025-03-08 01:42:24,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471035410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:24,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:24,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:24,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359041359]
[2025-03-08 01:42:24,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:24,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:24,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:24,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:24,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:24,753 INFO  L87              Difference]: Start difference. First operand 10544 states and 11875 transitions. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:25,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:25,371 INFO  L93              Difference]: Finished difference Result 21265 states and 24016 transitions.
[2025-03-08 01:42:25,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:25,371 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 476
[2025-03-08 01:42:25,372 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:25,390 INFO  L225             Difference]: With dead ends: 21265
[2025-03-08 01:42:25,390 INFO  L226             Difference]: Without dead ends: 12199
[2025-03-08 01:42:25,399 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-03-08 01:42:25,400 INFO  L435           NwaCegarLoop]: 329 mSDtfsCounter, 62 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:25,401 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 350 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:25,411 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12199 states.
[2025-03-08 01:42:25,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12199 to 11647.
[2025-03-08 01:42:25,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11647 states, 11646 states have (on average 1.1196118839086382) internal successors, (13039), 11646 states have internal predecessors, (13039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:25,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11647 states to 11647 states and 13039 transitions.
[2025-03-08 01:42:25,536 INFO  L78                 Accepts]: Start accepts. Automaton has 11647 states and 13039 transitions. Word has length 476
[2025-03-08 01:42:25,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:25,536 INFO  L471      AbstractCegarLoop]: Abstraction has 11647 states and 13039 transitions.
[2025-03-08 01:42:25,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:25,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 11647 states and 13039 transitions.
[2025-03-08 01:42:25,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 499
[2025-03-08 01:42:25,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:25,551 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:25,551 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 01:42:25,552 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:25,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:25,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1671489986, now seen corresponding path program 1 times
[2025-03-08 01:42:25,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:25,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361673822]
[2025-03-08 01:42:25,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:25,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:25,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes.
[2025-03-08 01:42:25,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements.
[2025-03-08 01:42:25,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:25,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:26,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 746 backedges. 448 proven. 24 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked.
[2025-03-08 01:42:26,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:26,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361673822]
[2025-03-08 01:42:26,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361673822] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:26,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953986703]
[2025-03-08 01:42:26,159 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:26,159 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:26,159 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:26,161 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:42:26,162 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 01:42:26,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes.
[2025-03-08 01:42:26,303 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements.
[2025-03-08 01:42:26,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:26,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:26,306 INFO  L256         TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:26,316 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:26,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 746 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked.
[2025-03-08 01:42:26,526 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:42:26,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953986703] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:26,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:42:26,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-03-08 01:42:26,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030288844]
[2025-03-08 01:42:26,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:26,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:26,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:26,527 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:26,527 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:26,527 INFO  L87              Difference]: Start difference. First operand 11647 states and 13039 transitions. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:27,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:27,068 INFO  L93              Difference]: Finished difference Result 23669 states and 26543 transitions.
[2025-03-08 01:42:27,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:27,068 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498
[2025-03-08 01:42:27,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:27,088 INFO  L225             Difference]: With dead ends: 23669
[2025-03-08 01:42:27,088 INFO  L226             Difference]: Without dead ends: 13684
[2025-03-08 01:42:27,097 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:27,097 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:27,097 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 78 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:27,105 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13684 states.
[2025-03-08 01:42:27,184 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13684 to 11831.
[2025-03-08 01:42:27,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11831 states, 11830 states have (on average 1.1186813186813187) internal successors, (13234), 11830 states have internal predecessors, (13234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:27,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 13234 transitions.
[2025-03-08 01:42:27,206 INFO  L78                 Accepts]: Start accepts. Automaton has 11831 states and 13234 transitions. Word has length 498
[2025-03-08 01:42:27,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:27,207 INFO  L471      AbstractCegarLoop]: Abstraction has 11831 states and 13234 transitions.
[2025-03-08 01:42:27,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:27,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 11831 states and 13234 transitions.
[2025-03-08 01:42:27,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 500
[2025-03-08 01:42:27,218 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:27,219 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:27,225 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 01:42:27,419 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-08 01:42:27,419 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:27,420 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:27,420 INFO  L85        PathProgramCache]: Analyzing trace with hash 1856484351, now seen corresponding path program 1 times
[2025-03-08 01:42:27,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:27,420 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390781794]
[2025-03-08 01:42:27,420 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:27,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:27,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes.
[2025-03-08 01:42:27,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements.
[2025-03-08 01:42:27,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:27,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:27,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2025-03-08 01:42:27,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:27,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390781794]
[2025-03-08 01:42:27,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390781794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:27,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:27,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:27,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422593936]
[2025-03-08 01:42:27,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:27,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:27,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:27,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:27,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:27,701 INFO  L87              Difference]: Start difference. First operand 11831 states and 13234 transitions. Second operand  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:28,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:28,203 INFO  L93              Difference]: Finished difference Result 25332 states and 28402 transitions.
[2025-03-08 01:42:28,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:28,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 499
[2025-03-08 01:42:28,204 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:28,220 INFO  L225             Difference]: With dead ends: 25332
[2025-03-08 01:42:28,220 INFO  L226             Difference]: Without dead ends: 13871
[2025-03-08 01:42:28,230 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-03-08 01:42:28,230 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 134 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:28,230 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 132 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:28,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13871 states.
[2025-03-08 01:42:28,330 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 13685.
[2025-03-08 01:42:28,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13685 states, 13684 states have (on average 1.1156825489622917) internal successors, (15267), 13684 states have internal predecessors, (15267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:28,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13685 states to 13685 states and 15267 transitions.
[2025-03-08 01:42:28,355 INFO  L78                 Accepts]: Start accepts. Automaton has 13685 states and 15267 transitions. Word has length 499
[2025-03-08 01:42:28,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:28,356 INFO  L471      AbstractCegarLoop]: Abstraction has 13685 states and 15267 transitions.
[2025-03-08 01:42:28,356 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:28,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 13685 states and 15267 transitions.
[2025-03-08 01:42:28,371 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 504
[2025-03-08 01:42:28,371 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:28,371 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-03-08 01:42:28,371 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 01:42:28,371 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:28,372 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:28,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 234852623, now seen corresponding path program 1 times
[2025-03-08 01:42:28,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:28,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815053803]
[2025-03-08 01:42:28,372 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:28,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:28,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes.
[2025-03-08 01:42:28,467 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements.
[2025-03-08 01:42:28,467 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:28,467 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:28,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked.
[2025-03-08 01:42:28,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:28,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815053803]
[2025-03-08 01:42:28,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815053803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:28,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:28,645 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:28,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818883447]
[2025-03-08 01:42:28,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:28,646 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:28,646 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:28,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:28,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:28,647 INFO  L87              Difference]: Start difference. First operand 13685 states and 15267 transitions. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:29,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:29,182 INFO  L93              Difference]: Finished difference Result 31051 states and 34702 transitions.
[2025-03-08 01:42:29,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:29,182 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 503
[2025-03-08 01:42:29,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:29,200 INFO  L225             Difference]: With dead ends: 31051
[2025-03-08 01:42:29,200 INFO  L226             Difference]: Without dead ends: 17736
[2025-03-08 01:42:29,209 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-03-08 01:42:29,209 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:29,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 86 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:29,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17736 states.
[2025-03-08 01:42:29,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17736 to 16985.
[2025-03-08 01:42:29,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16985 states, 16984 states have (on average 1.1102213848327838) internal successors, (18856), 16984 states have internal predecessors, (18856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:29,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 18856 transitions.
[2025-03-08 01:42:29,427 INFO  L78                 Accepts]: Start accepts. Automaton has 16985 states and 18856 transitions. Word has length 503
[2025-03-08 01:42:29,427 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:29,428 INFO  L471      AbstractCegarLoop]: Abstraction has 16985 states and 18856 transitions.
[2025-03-08 01:42:29,428 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:29,428 INFO  L276                IsEmpty]: Start isEmpty. Operand 16985 states and 18856 transitions.
[2025-03-08 01:42:29,444 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 510
[2025-03-08 01:42:29,444 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:29,445 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:29,445 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 01:42:29,445 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:29,445 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:29,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376883256, now seen corresponding path program 1 times
[2025-03-08 01:42:29,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:29,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237637077]
[2025-03-08 01:42:29,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:29,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:29,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes.
[2025-03-08 01:42:29,534 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements.
[2025-03-08 01:42:29,534 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:29,534 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:30,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2025-03-08 01:42:30,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:30,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237637077]
[2025-03-08 01:42:30,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237637077] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:30,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660779359]
[2025-03-08 01:42:30,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:30,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:30,220 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:30,222 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:42:30,223 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 01:42:30,276 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes.
[2025-03-08 01:42:30,343 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements.
[2025-03-08 01:42:30,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:30,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:30,345 INFO  L256         TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:30,376 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:30,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked.
[2025-03-08 01:42:30,473 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:42:30,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660779359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:30,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:42:30,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-03-08 01:42:30,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894033834]
[2025-03-08 01:42:30,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:30,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:30,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:30,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:30,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:30,475 INFO  L87              Difference]: Start difference. First operand 16985 states and 18856 transitions. Second operand  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:30,971 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:30,972 INFO  L93              Difference]: Finished difference Result 19747 states and 21905 transitions.
[2025-03-08 01:42:30,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:30,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 509
[2025-03-08 01:42:30,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:30,990 INFO  L225             Difference]: With dead ends: 19747
[2025-03-08 01:42:30,990 INFO  L226             Difference]: Without dead ends: 19745
[2025-03-08 01:42:30,995 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:30,995 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:30,995 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 139 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:31,007 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19745 states.
[2025-03-08 01:42:31,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19745 to 16985.
[2025-03-08 01:42:31,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16985 states, 16984 states have (on average 1.1101625058878946) internal successors, (18855), 16984 states have internal predecessors, (18855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:31,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 18855 transitions.
[2025-03-08 01:42:31,149 INFO  L78                 Accepts]: Start accepts. Automaton has 16985 states and 18855 transitions. Word has length 509
[2025-03-08 01:42:31,149 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:31,149 INFO  L471      AbstractCegarLoop]: Abstraction has 16985 states and 18855 transitions.
[2025-03-08 01:42:31,149 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:31,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 16985 states and 18855 transitions.
[2025-03-08 01:42:31,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 638
[2025-03-08 01:42:31,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:31,161 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:31,167 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 01:42:31,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-08 01:42:31,364 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:31,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:31,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 1226976336, now seen corresponding path program 1 times
[2025-03-08 01:42:31,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:31,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150739623]
[2025-03-08 01:42:31,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:31,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:31,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes.
[2025-03-08 01:42:31,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements.
[2025-03-08 01:42:31,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:31,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:31,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 1217 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked.
[2025-03-08 01:42:31,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:31,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150739623]
[2025-03-08 01:42:31,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150739623] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:31,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:31,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:42:31,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987096790]
[2025-03-08 01:42:31,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:31,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:31,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:31,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:31,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:31,913 INFO  L87              Difference]: Start difference. First operand 16985 states and 18855 transitions. Second operand  has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:32,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:32,877 INFO  L93              Difference]: Finished difference Result 38029 states and 42379 transitions.
[2025-03-08 01:42:32,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:32,877 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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 637
[2025-03-08 01:42:32,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:32,895 INFO  L225             Difference]: With dead ends: 38029
[2025-03-08 01:42:32,895 INFO  L226             Difference]: Without dead ends: 23258
[2025-03-08 01:42:32,903 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:32,903 INFO  L435           NwaCegarLoop]: 42 mSDtfsCounter, 214 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:32,903 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 73 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 01:42:32,912 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23258 states.
[2025-03-08 01:42:33,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23258 to 19017.
[2025-03-08 01:42:33,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19017 states, 19016 states have (on average 1.1155868742111905) internal successors, (21214), 19016 states have internal predecessors, (21214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:33,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19017 states to 19017 states and 21214 transitions.
[2025-03-08 01:42:33,139 INFO  L78                 Accepts]: Start accepts. Automaton has 19017 states and 21214 transitions. Word has length 637
[2025-03-08 01:42:33,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:33,140 INFO  L471      AbstractCegarLoop]: Abstraction has 19017 states and 21214 transitions.
[2025-03-08 01:42:33,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:33,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 19017 states and 21214 transitions.
[2025-03-08 01:42:33,160 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 709
[2025-03-08 01:42:33,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:33,161 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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]
[2025-03-08 01:42:33,161 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 01:42:33,161 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:33,161 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:33,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -285624709, now seen corresponding path program 1 times
[2025-03-08 01:42:33,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:33,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339274891]
[2025-03-08 01:42:33,162 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:33,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:33,222 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes.
[2025-03-08 01:42:33,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements.
[2025-03-08 01:42:33,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:33,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:33,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked.
[2025-03-08 01:42:33,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:33,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339274891]
[2025-03-08 01:42:33,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339274891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:33,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:33,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:33,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113340183]
[2025-03-08 01:42:33,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:33,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:33,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:33,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:33,493 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:33,493 INFO  L87              Difference]: Start difference. First operand 19017 states and 21214 transitions. Second operand  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:34,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:34,029 INFO  L93              Difference]: Finished difference Result 37118 states and 41394 transitions.
[2025-03-08 01:42:34,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:34,029 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 708
[2025-03-08 01:42:34,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:34,044 INFO  L225             Difference]: With dead ends: 37118
[2025-03-08 01:42:34,044 INFO  L226             Difference]: Without dead ends: 18471
[2025-03-08 01:42:34,054 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-03-08 01:42:34,054 INFO  L435           NwaCegarLoop]: 347 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:34,054 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 364 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:34,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18471 states.
[2025-03-08 01:42:34,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18471 to 18463.
[2025-03-08 01:42:34,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18463 states, 18462 states have (on average 1.096739248185462) internal successors, (20248), 18462 states have internal predecessors, (20248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:34,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18463 states to 18463 states and 20248 transitions.
[2025-03-08 01:42:34,221 INFO  L78                 Accepts]: Start accepts. Automaton has 18463 states and 20248 transitions. Word has length 708
[2025-03-08 01:42:34,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:34,221 INFO  L471      AbstractCegarLoop]: Abstraction has 18463 states and 20248 transitions.
[2025-03-08 01:42:34,221 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:34,221 INFO  L276                IsEmpty]: Start isEmpty. Operand 18463 states and 20248 transitions.
[2025-03-08 01:42:34,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 926
[2025-03-08 01:42:34,236 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:34,236 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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]
[2025-03-08 01:42:34,236 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 01:42:34,236 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:34,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:34,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -1569675170, now seen corresponding path program 1 times
[2025-03-08 01:42:34,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:34,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843460672]
[2025-03-08 01:42:34,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:34,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:34,281 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes.
[2025-03-08 01:42:34,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements.
[2025-03-08 01:42:34,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:34,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:34,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 2496 backedges. 1645 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked.
[2025-03-08 01:42:34,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:34,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843460672]
[2025-03-08 01:42:34,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843460672] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:34,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:34,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:34,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070559261]
[2025-03-08 01:42:34,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:34,591 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:34,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:34,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:34,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:34,591 INFO  L87              Difference]: Start difference. First operand 18463 states and 20248 transitions. Second operand  has 4 states, 4 states have (on average 114.5) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:35,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:35,435 INFO  L93              Difference]: Finished difference Result 36191 states and 39683 transitions.
[2025-03-08 01:42:35,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:35,435 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 114.5) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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 925
[2025-03-08 01:42:35,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:35,451 INFO  L225             Difference]: With dead ends: 36191
[2025-03-08 01:42:35,451 INFO  L226             Difference]: Without dead ends: 19942
[2025-03-08 01:42:35,456 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-03-08 01:42:35,456 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 160 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:35,456 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 71 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:42:35,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19942 states.
[2025-03-08 01:42:35,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19942 to 18463.
[2025-03-08 01:42:35,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18463 states, 18462 states have (on average 1.096414256310259) internal successors, (20242), 18462 states have internal predecessors, (20242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:35,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18463 states to 18463 states and 20242 transitions.
[2025-03-08 01:42:35,580 INFO  L78                 Accepts]: Start accepts. Automaton has 18463 states and 20242 transitions. Word has length 925
[2025-03-08 01:42:35,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:35,580 INFO  L471      AbstractCegarLoop]: Abstraction has 18463 states and 20242 transitions.
[2025-03-08 01:42:35,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 114.5) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:35,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 18463 states and 20242 transitions.
[2025-03-08 01:42:35,595 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 977
[2025-03-08 01:42:35,595 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:35,595 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:35,595 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 01:42:35,595 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:35,596 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:35,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1119433031, now seen corresponding path program 1 times
[2025-03-08 01:42:35,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:35,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990466384]
[2025-03-08 01:42:35,596 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:35,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:35,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes.
[2025-03-08 01:42:35,676 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements.
[2025-03-08 01:42:35,676 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:35,676 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:37,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 3149 backedges. 1889 proven. 106 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked.
[2025-03-08 01:42:37,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:37,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990466384]
[2025-03-08 01:42:37,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990466384] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:37,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076031479]
[2025-03-08 01:42:37,114 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:37,114 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:37,114 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:37,117 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:42:37,118 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 01:42:37,214 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes.
[2025-03-08 01:42:37,345 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements.
[2025-03-08 01:42:37,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:37,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:37,349 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:37,357 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:37,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 3149 backedges. 1909 proven. 434 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked.
[2025-03-08 01:42:37,805 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 01:42:38,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 3149 backedges. 2343 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked.
[2025-03-08 01:42:38,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076031479] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:38,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-08 01:42:38,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12
[2025-03-08 01:42:38,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966052097]
[2025-03-08 01:42:38,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:38,320 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 01:42:38,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:38,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 01:42:38,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2025-03-08 01:42:38,321 INFO  L87              Difference]: Start difference. First operand 18463 states and 20242 transitions. Second operand  has 5 states, 5 states have (on average 110.8) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:39,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:39,181 INFO  L93              Difference]: Finished difference Result 41346 states and 45373 transitions.
[2025-03-08 01:42:39,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:39,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 110.8) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 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 976
[2025-03-08 01:42:39,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:39,203 INFO  L225             Difference]: With dead ends: 41346
[2025-03-08 01:42:39,203 INFO  L226             Difference]: Without dead ends: 25097
[2025-03-08 01:42:39,214 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1945 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2025-03-08 01:42:39,214 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:39,214 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 67 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 01:42:39,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25097 states.
[2025-03-08 01:42:39,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25097 to 18095.
[2025-03-08 01:42:39,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18095 states, 18094 states have (on average 1.097380347076379) internal successors, (19856), 18094 states have internal predecessors, (19856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:39,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18095 states to 18095 states and 19856 transitions.
[2025-03-08 01:42:39,413 INFO  L78                 Accepts]: Start accepts. Automaton has 18095 states and 19856 transitions. Word has length 976
[2025-03-08 01:42:39,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:39,413 INFO  L471      AbstractCegarLoop]: Abstraction has 18095 states and 19856 transitions.
[2025-03-08 01:42:39,413 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 110.8) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:39,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 18095 states and 19856 transitions.
[2025-03-08 01:42:39,429 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 988
[2025-03-08 01:42:39,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:39,429 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-03-08 01:42:39,436 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 01:42:39,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:39,630 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:39,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:39,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -920636086, now seen corresponding path program 1 times
[2025-03-08 01:42:39,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:39,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599363708]
[2025-03-08 01:42:39,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:39,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:39,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes.
[2025-03-08 01:42:39,701 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements.
[2025-03-08 01:42:39,701 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:39,701 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:40,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 3228 backedges. 1886 proven. 64 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked.
[2025-03-08 01:42:40,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:40,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599363708]
[2025-03-08 01:42:40,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599363708] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:40,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709042288]
[2025-03-08 01:42:40,376 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:40,376 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:40,376 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:40,378 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:42:40,378 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 01:42:40,479 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes.
[2025-03-08 01:42:40,595 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements.
[2025-03-08 01:42:40,595 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:40,595 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:40,598 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:40,603 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:40,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 3228 backedges. 1950 proven. 0 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked.
[2025-03-08 01:42:40,717 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:42:40,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709042288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:40,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:42:40,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:42:40,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009362186]
[2025-03-08 01:42:40,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:40,718 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:40,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:40,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:40,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:42:40,719 INFO  L87              Difference]: Start difference. First operand 18095 states and 19856 transitions. Second operand  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:41,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:41,181 INFO  L93              Difference]: Finished difference Result 39145 states and 42951 transitions.
[2025-03-08 01:42:41,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:41,182 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 987
[2025-03-08 01:42:41,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:41,200 INFO  L225             Difference]: With dead ends: 39145
[2025-03-08 01:42:41,200 INFO  L226             Difference]: Without dead ends: 20868
[2025-03-08 01:42:41,211 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 986 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-03-08 01:42:41,212 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 79 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:41,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 346 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:41,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20868 states.
[2025-03-08 01:42:41,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20868 to 18831.
[2025-03-08 01:42:41,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18831 states, 18830 states have (on average 1.0956983536909188) internal successors, (20632), 18830 states have internal predecessors, (20632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:41,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 20632 transitions.
[2025-03-08 01:42:41,377 INFO  L78                 Accepts]: Start accepts. Automaton has 18831 states and 20632 transitions. Word has length 987
[2025-03-08 01:42:41,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:41,378 INFO  L471      AbstractCegarLoop]: Abstraction has 18831 states and 20632 transitions.
[2025-03-08 01:42:41,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:41,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 18831 states and 20632 transitions.
[2025-03-08 01:42:41,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1069
[2025-03-08 01:42:41,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:41,393 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:41,400 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 01:42:41,593 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:41,594 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:41,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:41,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -2114984664, now seen corresponding path program 1 times
[2025-03-08 01:42:41,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:41,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460822470]
[2025-03-08 01:42:41,594 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:41,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:41,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1068 statements into 1 equivalence classes.
[2025-03-08 01:42:41,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1068 of 1068 statements.
[2025-03-08 01:42:41,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:41,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:41,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 3924 backedges. 2160 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked.
[2025-03-08 01:42:41,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:41,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460822470]
[2025-03-08 01:42:41,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460822470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:41,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:41,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:41,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271115277]
[2025-03-08 01:42:41,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:41,869 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:41,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:41,870 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:41,870 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:41,870 INFO  L87              Difference]: Start difference. First operand 18831 states and 20632 transitions. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:42,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:42,138 INFO  L93              Difference]: Finished difference Result 37103 states and 40651 transitions.
[2025-03-08 01:42:42,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:42,139 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 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 1068
[2025-03-08 01:42:42,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:42,156 INFO  L225             Difference]: With dead ends: 37103
[2025-03-08 01:42:42,156 INFO  L226             Difference]: Without dead ends: 18274
[2025-03-08 01:42:42,168 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-03-08 01:42:42,169 INFO  L435           NwaCegarLoop]: 39 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:42,169 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 39 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 01:42:42,178 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18274 states.
[2025-03-08 01:42:42,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18274 to 18271.
[2025-03-08 01:42:42,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18271 states, 18270 states have (on average 1.0954022988505747) internal successors, (20013), 18270 states have internal predecessors, (20013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:42,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18271 states to 18271 states and 20013 transitions.
[2025-03-08 01:42:42,356 INFO  L78                 Accepts]: Start accepts. Automaton has 18271 states and 20013 transitions. Word has length 1068
[2025-03-08 01:42:42,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:42,357 INFO  L471      AbstractCegarLoop]: Abstraction has 18271 states and 20013 transitions.
[2025-03-08 01:42:42,357 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:42,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 18271 states and 20013 transitions.
[2025-03-08 01:42:42,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1080
[2025-03-08 01:42:42,372 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:42,372 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 01:42:42,372 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 01:42:42,373 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:42,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:42,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 1309552476, now seen corresponding path program 1 times
[2025-03-08 01:42:42,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:42,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5554328]
[2025-03-08 01:42:42,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:42,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:42,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes.
[2025-03-08 01:42:42,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements.
[2025-03-08 01:42:42,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:42,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:42,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 3782 backedges. 2000 proven. 0 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked.
[2025-03-08 01:42:42,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:42,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5554328]
[2025-03-08 01:42:42,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5554328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:42,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:42,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:42,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079447738]
[2025-03-08 01:42:42,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:42,877 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:42,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:42,877 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:42,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:42,878 INFO  L87              Difference]: Start difference. First operand 18271 states and 20013 transitions. Second operand  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:43,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:43,386 INFO  L93              Difference]: Finished difference Result 38942 states and 42603 transitions.
[2025-03-08 01:42:43,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:43,387 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1079
[2025-03-08 01:42:43,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:43,406 INFO  L225             Difference]: With dead ends: 38942
[2025-03-08 01:42:43,406 INFO  L226             Difference]: Without dead ends: 20117
[2025-03-08 01:42:43,419 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-03-08 01:42:43,420 INFO  L435           NwaCegarLoop]: 323 mSDtfsCounter, 44 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:43,420 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 341 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:43,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20117 states.
[2025-03-08 01:42:43,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20117 to 18641.
[2025-03-08 01:42:43,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18641 states, 18640 states have (on average 1.0940450643776825) internal successors, (20393), 18640 states have internal predecessors, (20393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:43,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18641 states to 18641 states and 20393 transitions.
[2025-03-08 01:42:43,652 INFO  L78                 Accepts]: Start accepts. Automaton has 18641 states and 20393 transitions. Word has length 1079
[2025-03-08 01:42:43,652 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:43,652 INFO  L471      AbstractCegarLoop]: Abstraction has 18641 states and 20393 transitions.
[2025-03-08 01:42:43,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:43,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 18641 states and 20393 transitions.
[2025-03-08 01:42:43,679 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1162
[2025-03-08 01:42:43,680 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:43,680 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 01:42:43,680 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 01:42:43,680 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:43,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:43,681 INFO  L85        PathProgramCache]: Analyzing trace with hash -1740712754, now seen corresponding path program 1 times
[2025-03-08 01:42:43,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:43,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076750624]
[2025-03-08 01:42:43,681 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:43,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:43,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1161 statements into 1 equivalence classes.
[2025-03-08 01:42:43,839 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1161 of 1161 statements.
[2025-03-08 01:42:43,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:43,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:44,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 4788 backedges. 2386 proven. 0 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked.
[2025-03-08 01:42:44,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:44,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076750624]
[2025-03-08 01:42:44,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076750624] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:44,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:44,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:44,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152059952]
[2025-03-08 01:42:44,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:44,503 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:44,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:44,504 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:44,504 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:44,504 INFO  L87              Difference]: Start difference. First operand 18641 states and 20393 transitions. Second operand  has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:45,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:45,257 INFO  L93              Difference]: Finished difference Result 44837 states and 48986 transitions.
[2025-03-08 01:42:45,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:45,258 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 1161
[2025-03-08 01:42:45,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:45,281 INFO  L225             Difference]: With dead ends: 44837
[2025-03-08 01:42:45,281 INFO  L226             Difference]: Without dead ends: 26012
[2025-03-08 01:42:45,294 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-03-08 01:42:45,295 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:45,295 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 79 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:42:45,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26012 states.
[2025-03-08 01:42:45,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26012 to 23055.
[2025-03-08 01:42:45,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23055 states, 23054 states have (on average 1.0934761863451028) internal successors, (25209), 23054 states have internal predecessors, (25209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:45,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23055 states to 23055 states and 25209 transitions.
[2025-03-08 01:42:45,532 INFO  L78                 Accepts]: Start accepts. Automaton has 23055 states and 25209 transitions. Word has length 1161
[2025-03-08 01:42:45,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:45,533 INFO  L471      AbstractCegarLoop]: Abstraction has 23055 states and 25209 transitions.
[2025-03-08 01:42:45,533 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 103.75) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:45,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 23055 states and 25209 transitions.
[2025-03-08 01:42:45,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1181
[2025-03-08 01:42:45,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:45,552 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:42:45,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 01:42:45,552 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:45,553 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:45,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -1013566145, now seen corresponding path program 1 times
[2025-03-08 01:42:45,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:45,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653586621]
[2025-03-08 01:42:45,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:45,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:45,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1180 statements into 1 equivalence classes.
[2025-03-08 01:42:45,628 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1180 of 1180 statements.
[2025-03-08 01:42:45,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:45,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:45,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 4235 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked.
[2025-03-08 01:42:45,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:45,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653586621]
[2025-03-08 01:42:45,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653586621] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:45,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:45,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:45,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405151671]
[2025-03-08 01:42:45,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:45,856 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:45,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:45,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:45,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:45,857 INFO  L87              Difference]: Start difference. First operand 23055 states and 25209 transitions. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:46,134 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:46,135 INFO  L93              Difference]: Finished difference Result 43713 states and 47812 transitions.
[2025-03-08 01:42:46,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:46,135 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 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 1180
[2025-03-08 01:42:46,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:46,155 INFO  L225             Difference]: With dead ends: 43713
[2025-03-08 01:42:46,156 INFO  L226             Difference]: Without dead ends: 22870
[2025-03-08 01:42:46,168 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-03-08 01:42:46,169 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:46,169 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 32 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 01:42:46,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22870 states.
[2025-03-08 01:42:46,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22870 to 22870.
[2025-03-08 01:42:46,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22870 states, 22869 states have (on average 1.0934015479470025) internal successors, (25005), 22869 states have internal predecessors, (25005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:46,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22870 states to 22870 states and 25005 transitions.
[2025-03-08 01:42:46,358 INFO  L78                 Accepts]: Start accepts. Automaton has 22870 states and 25005 transitions. Word has length 1180
[2025-03-08 01:42:46,358 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:46,358 INFO  L471      AbstractCegarLoop]: Abstraction has 22870 states and 25005 transitions.
[2025-03-08 01:42:46,358 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:46,358 INFO  L276                IsEmpty]: Start isEmpty. Operand 22870 states and 25005 transitions.
[2025-03-08 01:42:46,377 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1197
[2025-03-08 01:42:46,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:46,377 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:46,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-08 01:42:46,378 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:46,378 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:46,378 INFO  L85        PathProgramCache]: Analyzing trace with hash -1881759449, now seen corresponding path program 1 times
[2025-03-08 01:42:46,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:46,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645737345]
[2025-03-08 01:42:46,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:46,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:46,433 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes.
[2025-03-08 01:42:46,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements.
[2025-03-08 01:42:46,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:46,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:46,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 4251 backedges. 2680 proven. 0 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked.
[2025-03-08 01:42:46,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:46,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645737345]
[2025-03-08 01:42:46,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645737345] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:46,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:46,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:46,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296718119]
[2025-03-08 01:42:46,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:46,972 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:46,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:46,973 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:46,973 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:46,973 INFO  L87              Difference]: Start difference. First operand 22870 states and 25005 transitions. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:47,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:47,479 INFO  L93              Difference]: Finished difference Result 49421 states and 53988 transitions.
[2025-03-08 01:42:47,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:47,479 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 1196
[2025-03-08 01:42:47,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:47,504 INFO  L225             Difference]: With dead ends: 49421
[2025-03-08 01:42:47,504 INFO  L226             Difference]: Without dead ends: 26921
[2025-03-08 01:42:47,519 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-03-08 01:42:47,519 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:47,519 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 65 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:47,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26921 states.
[2025-03-08 01:42:47,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26921 to 23054.
[2025-03-08 01:42:47,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23054 states, 23053 states have (on average 1.0926994317442416) internal successors, (25190), 23053 states have internal predecessors, (25190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:47,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23054 states to 23054 states and 25190 transitions.
[2025-03-08 01:42:47,731 INFO  L78                 Accepts]: Start accepts. Automaton has 23054 states and 25190 transitions. Word has length 1196
[2025-03-08 01:42:47,731 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:47,731 INFO  L471      AbstractCegarLoop]: Abstraction has 23054 states and 25190 transitions.
[2025-03-08 01:42:47,731 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:47,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 23054 states and 25190 transitions.
[2025-03-08 01:42:47,751 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1258
[2025-03-08 01:42:47,751 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:47,751 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 01:42:47,751 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-08 01:42:47,751 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:47,752 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:47,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 833894273, now seen corresponding path program 1 times
[2025-03-08 01:42:47,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:47,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196984809]
[2025-03-08 01:42:47,752 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:47,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:47,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1257 statements into 1 equivalence classes.
[2025-03-08 01:42:47,852 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1257 of 1257 statements.
[2025-03-08 01:42:47,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:47,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:48,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 5780 backedges. 2988 proven. 0 refuted. 0 times theorem prover too weak. 2792 trivial. 0 not checked.
[2025-03-08 01:42:48,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:48,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196984809]
[2025-03-08 01:42:48,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196984809] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:48,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:48,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:42:48,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472404723]
[2025-03-08 01:42:48,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:48,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:48,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:48,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:48,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:48,832 INFO  L87              Difference]: Start difference. First operand 23054 states and 25190 transitions. Second operand  has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:49,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:49,538 INFO  L93              Difference]: Finished difference Result 42419 states and 46273 transitions.
[2025-03-08 01:42:49,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:49,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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 1257
[2025-03-08 01:42:49,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:49,540 INFO  L225             Difference]: With dead ends: 42419
[2025-03-08 01:42:49,540 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 01:42:49,555 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:49,555 INFO  L435           NwaCegarLoop]: 22 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:49,555 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 43 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:49,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 01:42:49,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 01:42:49,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:49,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 01:42:49,556 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1257
[2025-03-08 01:42:49,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:49,556 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 01:42:49,557 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:49,557 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 01:42:49,557 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 01:42:49,559 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 01:42:49,559 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-08 01:42:49,561 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:49,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 01:42:59,210 WARN  L286               SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 593 DAG size of output: 757 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)
[2025-03-08 01:43:01,645 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 01:43:01,662 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:43:01 BoogieIcfgContainer
[2025-03-08 01:43:01,665 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 01:43:01,666 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 01:43:01,666 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 01:43:01,666 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 01:43:01,667 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:13" (3/4) ...
[2025-03-08 01:43:01,668 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 01:43:01,689 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-08 01:43:01,690 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 01:43:01,691 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 01:43:01,692 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 01:43:01,813 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 01:43:01,813 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 01:43:01,813 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 01:43:01,813 INFO  L158              Benchmark]: Toolchain (without parser) took 49963.44ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 101.7MB in the beginning and 503.9MB in the end (delta: -402.2MB). Peak memory consumption was 209.8MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,814 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 01:43:01,814 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 525.34ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 58.1MB in the end (delta: 43.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,814 INFO  L158              Benchmark]: Boogie Procedure Inliner took 104.24ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 41.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,814 INFO  L158              Benchmark]: Boogie Preprocessor took 170.59ms. Allocated memory is still 142.6MB. Free memory was 41.4MB in the beginning and 80.1MB in the end (delta: -38.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,814 INFO  L158              Benchmark]: IcfgBuilder took 1312.93ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 32.5MB in the end (delta: 47.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,815 INFO  L158              Benchmark]: TraceAbstraction took 47697.58ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 31.6MB in the beginning and 520.7MB in the end (delta: -489.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,815 INFO  L158              Benchmark]: Witness Printer took 146.81ms. Allocated memory is still 755.0MB. Free memory was 520.7MB in the beginning and 503.9MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 01:43:01,816 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 525.34ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 58.1MB in the end (delta: 43.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 104.24ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 41.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 170.59ms. Allocated memory is still 142.6MB. Free memory was 41.4MB in the beginning and 80.1MB in the end (delta: -38.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1312.93ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 32.5MB in the end (delta: 47.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 47697.58ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 31.6MB in the beginning and 520.7MB in the end (delta: -489.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
 * Witness Printer took 146.81ms. Allocated memory is still 755.0MB. Free memory was 520.7MB in the beginning and 503.9MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 133]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 283 locations, 481 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.5s, OverallIterations: 27, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3951 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3951 mSDsluCounter, 4605 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 2763 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17278 IncrementalHoareTripleChecker+Invalid, 20041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2763 mSolverCounterUnsat, 4067 mSDtfsCounter, 17278 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4026 GetRequests, 3973 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23055occurred in iteration=24, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 29569 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 19428 NumberOfCodeBlocks, 19428 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 20372 ConstructedInterpolants, 0 QuantifiedInterpolants, 49092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3818 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 32 InterpolantComputations, 27 PerfectInterpolantSequences, 54631/55665 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 1044]: Location Invariant
    Derived location invariant: (((((((((((((((((((((((((((((a29 <= 140) && (a3 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((a8 <= 15) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a29 <= 130))) || (((((((a23 <= 600177) && (a25 == 11)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) || (((((((a25 == 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130))) && (a8 <= 15)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 137))) || (((a3 == 1) && (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (246 <= a29)) || ((((((long long) a23 + 43) <= 0) && (a29 <= 310110)) && (a25 <= 9)) && (246 <= a29)))) && (a8 == 15))) || ((((((a25 == 12) && (a23 <= 600177)) && (a29 <= 274)) && (a3 == 1)) && (312 <= a23)) && (a8 == 15))) || (((((a23 <= 600177) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15))) || ((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15)) && (246 <= a29))) || (((((((a25 == 12) && (139 <= a23)) && (a29 <= 310110)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a8 <= 15)) && (((a25 <= 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130)))) && (a4 == 1))) || ((((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15))) || ((((((a25 == 11) && (a29 <= 274)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || ((((((a25 == 11) && (a8 <= 15)) && (a3 == 1)) && (a4 == 1)) && (246 <= a29)) && (a23 <= 137))) || (((((a25 == 12) && (139 <= a23)) && (a3 == 1)) && (a29 <= 220)) && (a8 == 15))) || ((((((a25 == 12) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a23 <= 600177) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((((a29 <= 140) && (a3 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a8 == 15))) || ((((((a25 == 12) && (a29 <= 599998)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15)) && (a23 <= 137))) || ((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((((a25 == 13) && (a3 == 1)) && (a8 == 15)) && (((long long) 59274 + a29) <= 0)) && (a23 <= 137))) || ((((((a25 == 13) && (139 <= a23)) && (a29 <= 310110)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 <= 10) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 11) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 01:43:01,833 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE