./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label30.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_label30.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 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 01:42:29,351 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 01:42:29,401 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:29,406 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 01:42:29,407 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 01:42:29,427 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 01:42:29,429 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 01:42:29,429 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 01:42:29,429 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 01:42:29,429 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 01:42:29,430 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 01:42:29,430 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 01:42:29,430 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 01:42:29,430 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 01:42:29,431 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 01:42:29,431 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 01:42:29,432 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 01:42:29,432 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:42:29,433 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 01:42:29,433 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 01:42:29,434 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 01:42:29,434 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 -> 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987
[2025-03-08 01:42:29,685 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 01:42:29,691 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 01:42:29,693 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 01:42:29,694 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 01:42:29,694 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 01:42:29,695 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label30.c
[2025-03-08 01:42:30,872 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483419df8/284fdfd9e02346d5839f0c54952c1fd2/FLAG12d334f5a
[2025-03-08 01:42:31,177 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 01:42:31,178 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c
[2025-03-08 01:42:31,190 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483419df8/284fdfd9e02346d5839f0c54952c1fd2/FLAG12d334f5a
[2025-03-08 01:42:31,447 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483419df8/284fdfd9e02346d5839f0c54952c1fd2
[2025-03-08 01:42:31,448 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 01:42:31,449 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 01:42:31,450 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 01:42:31,450 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 01:42:31,453 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 01:42:31,453 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:31" (1/1) ...
[2025-03-08 01:42:31,454 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:31, skipping insertion in model container
[2025-03-08 01:42:31,454 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:31" (1/1) ...
[2025-03-08 01:42:31,485 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 01:42:31,628 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_label30.c[4279,4292]
[2025-03-08 01:42:31,812 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:42:31,819 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 01:42:31,837 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_label30.c[4279,4292]
[2025-03-08 01:42:31,924 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:42:31,936 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 01:42:31,937 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:31 WrapperNode
[2025-03-08 01:42:31,938 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 01:42:31,938 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 01:42:31,939 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 01:42:31,939 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 01:42:31,943 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:31" (1/1) ...
[2025-03-08 01:42:31,960 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:31" (1/1) ...
[2025-03-08 01:42:32,026 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997
[2025-03-08 01:42:32,026 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 01:42:32,027 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 01:42:32,027 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 01:42:32,027 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 01:42:32,033 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:31" (1/1) ...
[2025-03-08 01:42:32,033 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:31" (1/1) ...
[2025-03-08 01:42:32,048 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:31" (1/1) ...
[2025-03-08 01:42:32,104 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:32,105 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:31" (1/1) ...
[2025-03-08 01:42:32,105 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:31" (1/1) ...
[2025-03-08 01:42:32,135 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:31" (1/1) ...
[2025-03-08 01:42:32,144 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:31" (1/1) ...
[2025-03-08 01:42:32,151 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:31" (1/1) ...
[2025-03-08 01:42:32,157 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:31" (1/1) ...
[2025-03-08 01:42:32,166 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 01:42:32,167 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 01:42:32,167 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 01:42:32,167 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 01:42:32,168 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:31" (1/1) ...
[2025-03-08 01:42:32,172 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:42:32,182 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:32,193 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:32,199 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:32,215 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 01:42:32,215 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 01:42:32,215 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 01:42:32,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 01:42:32,264 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 01:42:32,265 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 01:42:33,501 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2025-03-08 01:42:33,502 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 01:42:33,512 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 01:42:33,515 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 01:42:33,515 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:33 BoogieIcfgContainer
[2025-03-08 01:42:33,515 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 01:42:33,517 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 01:42:33,517 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 01:42:33,520 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 01:42:33,520 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:42:31" (1/3) ...
[2025-03-08 01:42:33,520 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8bb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:33, skipping insertion in model container
[2025-03-08 01:42:33,520 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:31" (2/3) ...
[2025-03-08 01:42:33,521 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8bb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:33, skipping insertion in model container
[2025-03-08 01:42:33,521 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:33" (3/3) ...
[2025-03-08 01:42:33,522 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem11_label30.c
[2025-03-08 01:42:33,534 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 01:42:33,535 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label30.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 01:42:33,582 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 01:42:33,590 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;@490121ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 01:42:33,590 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 01:42:33,594 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:33,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-03-08 01:42:33,598 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:33,598 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]
[2025-03-08 01:42:33,599 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:33,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:33,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -362269229, now seen corresponding path program 1 times
[2025-03-08 01:42:33,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:33,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341485060]
[2025-03-08 01:42:33,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:33,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:33,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-08 01:42:33,706 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-08 01:42:33,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:33,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:33,840 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:33,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:33,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341485060]
[2025-03-08 01:42:33,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341485060] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:33,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:33,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:33,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562414651]
[2025-03-08 01:42:33,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:33,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:33,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:33,860 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:33,861 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:33,864 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 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:34,823 INFO  L93              Difference]: Finished difference Result 761 states and 1342 transitions.
[2025-03-08 01:42:34,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:34,826 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29
[2025-03-08 01:42:34,826 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:34,834 INFO  L225             Difference]: With dead ends: 761
[2025-03-08 01:42:34,835 INFO  L226             Difference]: Without dead ends: 413
[2025-03-08 01:42:34,839 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:34,841 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 199 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:34,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 01:42:34,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2025-03-08 01:42:34,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413.
[2025-03-08 01:42:34,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions.
[2025-03-08 01:42:34,893 INFO  L78                 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 29
[2025-03-08 01:42:34,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:34,894 INFO  L471      AbstractCegarLoop]: Abstraction has 413 states and 599 transitions.
[2025-03-08 01:42:34,894 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions.
[2025-03-08 01:42:34,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2025-03-08 01:42:34,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:34,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,898 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 01:42:34,898 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:34,899 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:34,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 1515858429, now seen corresponding path program 1 times
[2025-03-08 01:42:34,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:34,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342723849]
[2025-03-08 01:42:34,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:34,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:34,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-08 01:42:34,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-08 01:42:34,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:34,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:35,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:35,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:35,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342723849]
[2025-03-08 01:42:35,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342723849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:35,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:35,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:42:35,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092106507]
[2025-03-08 01:42:35,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:35,140 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:35,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:35,140 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:35,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:35,141 INFO  L87              Difference]: Start difference. First operand 413 states and 599 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:35,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:35,802 INFO  L93              Difference]: Finished difference Result 1211 states and 1763 transitions.
[2025-03-08 01:42:35,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:35,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97
[2025-03-08 01:42:35,803 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:35,805 INFO  L225             Difference]: With dead ends: 1211
[2025-03-08 01:42:35,806 INFO  L226             Difference]: Without dead ends: 800
[2025-03-08 01:42:35,806 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:35,807 INFO  L435           NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:35,807 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:35,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2025-03-08 01:42:35,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789.
[2025-03-08 01:42:35,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions.
[2025-03-08 01:42:35,837 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 97
[2025-03-08 01:42:35,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:35,838 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions.
[2025-03-08 01:42:35,838 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:35,838 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions.
[2025-03-08 01:42:35,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-08 01:42:35,840 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:35,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,840 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 01:42:35,840 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:35,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:35,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1160047449, now seen corresponding path program 1 times
[2025-03-08 01:42:35,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:35,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186698738]
[2025-03-08 01:42:35,841 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:35,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:35,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-08 01:42:35,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-08 01:42:35,876 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:35,876 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:36,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:36,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:36,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186698738]
[2025-03-08 01:42:36,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186698738] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:36,181 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:36,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:36,181 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904622206]
[2025-03-08 01:42:36,181 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:36,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:36,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:36,182 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:36,182 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:36,182 INFO  L87              Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand  has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:37,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:37,258 INFO  L93              Difference]: Finished difference Result 2505 states and 3428 transitions.
[2025-03-08 01:42:37,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:37,259 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98
[2025-03-08 01:42:37,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:37,266 INFO  L225             Difference]: With dead ends: 2505
[2025-03-08 01:42:37,266 INFO  L226             Difference]: Without dead ends: 1718
[2025-03-08 01:42:37,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:42:37,271 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:37,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 01:42:37,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2025-03-08 01:42:37,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714.
[2025-03-08 01:42:37,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 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:37,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions.
[2025-03-08 01:42:37,299 INFO  L78                 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 98
[2025-03-08 01:42:37,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:37,299 INFO  L471      AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions.
[2025-03-08 01:42:37,299 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:37,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions.
[2025-03-08 01:42:37,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-08 01:42:37,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:37,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,301 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 01:42:37,301 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:37,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:37,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295171761, now seen corresponding path program 1 times
[2025-03-08 01:42:37,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:37,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378923231]
[2025-03-08 01:42:37,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:37,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:37,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-08 01:42:37,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-08 01:42:37,341 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:37,341 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:37,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:37,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:37,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378923231]
[2025-03-08 01:42:37,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378923231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:37,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:37,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:37,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594804552]
[2025-03-08 01:42:37,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:37,524 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:37,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:37,525 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:37,525 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:37,525 INFO  L87              Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand  has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:38,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:38,562 INFO  L93              Difference]: Finished difference Result 5296 states and 6687 transitions.
[2025-03-08 01:42:38,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:38,563 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-08 01:42:38,563 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:38,572 INFO  L225             Difference]: With dead ends: 5296
[2025-03-08 01:42:38,573 INFO  L226             Difference]: Without dead ends: 3768
[2025-03-08 01:42:38,574 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:38,575 INFO  L435           NwaCegarLoop]: 41 mSDtfsCounter, 365 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:38,575 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 01:42:38,579 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3768 states.
[2025-03-08 01:42:38,614 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3767.
[2025-03-08 01:42:38,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3767 states, 3766 states have (on average 1.2291556027615507) internal successors, (4629), 3766 states have internal predecessors, (4629), 0 states have call successors, (0), 0 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:38,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4629 transitions.
[2025-03-08 01:42:38,626 INFO  L78                 Accepts]: Start accepts. Automaton has 3767 states and 4629 transitions. Word has length 156
[2025-03-08 01:42:38,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:38,626 INFO  L471      AbstractCegarLoop]: Abstraction has 3767 states and 4629 transitions.
[2025-03-08 01:42:38,626 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:38,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 3767 states and 4629 transitions.
[2025-03-08 01:42:38,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-08 01:42:38,631 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:38,631 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:38,631 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 01:42:38,631 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:38,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:38,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452132319, now seen corresponding path program 1 times
[2025-03-08 01:42:38,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:38,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429838326]
[2025-03-08 01:42:38,632 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:38,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:38,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 01:42:38,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 01:42:38,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:38,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:38,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:38,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:38,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429838326]
[2025-03-08 01:42:38,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429838326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:38,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:38,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:38,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131453963]
[2025-03-08 01:42:38,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:38,826 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:38,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:38,827 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:38,827 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:38,827 INFO  L87              Difference]: Start difference. First operand 3767 states and 4629 transitions. Second operand  has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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,433 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:39,434 INFO  L93              Difference]: Finished difference Result 8652 states and 10854 transitions.
[2025-03-08 01:42:39,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:39,434 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209
[2025-03-08 01:42:39,435 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:39,448 INFO  L225             Difference]: With dead ends: 8652
[2025-03-08 01:42:39,448 INFO  L226             Difference]: Without dead ends: 5256
[2025-03-08 01:42:39,452 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:39,453 INFO  L435           NwaCegarLoop]: 325 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:39,454 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:39,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5256 states.
[2025-03-08 01:42:39,523 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5241.
[2025-03-08 01:42:39,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5241 states, 5240 states have (on average 1.208206106870229) internal successors, (6331), 5240 states have internal predecessors, (6331), 0 states have call successors, (0), 0 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,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 6331 transitions.
[2025-03-08 01:42:39,538 INFO  L78                 Accepts]: Start accepts. Automaton has 5241 states and 6331 transitions. Word has length 209
[2025-03-08 01:42:39,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:39,539 INFO  L471      AbstractCegarLoop]: Abstraction has 5241 states and 6331 transitions.
[2025-03-08 01:42:39,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 5241 states and 6331 transitions.
[2025-03-08 01:42:39,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-08 01:42:39,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:39,541 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:39,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 01:42:39,541 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:39,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:39,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1159410437, now seen corresponding path program 1 times
[2025-03-08 01:42:39,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:39,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732209890]
[2025-03-08 01:42:39,542 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:39,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:39,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 01:42:39,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 01:42:39,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:39,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:39,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-03-08 01:42:39,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:39,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732209890]
[2025-03-08 01:42:39,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732209890] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:39,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:39,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:39,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275415729]
[2025-03-08 01:42:39,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:39,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:39,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:39,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:39,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:39,689 INFO  L87              Difference]: Start difference. First operand 5241 states and 6331 transitions. Second operand  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:40,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:40,249 INFO  L93              Difference]: Finished difference Result 11049 states and 13480 transitions.
[2025-03-08 01:42:40,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:40,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 210
[2025-03-08 01:42:40,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:40,266 INFO  L225             Difference]: With dead ends: 11049
[2025-03-08 01:42:40,266 INFO  L226             Difference]: Without dead ends: 6179
[2025-03-08 01:42:40,271 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:40,271 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 173 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:40,273 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 347 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:40,278 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6179 states.
[2025-03-08 01:42:40,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 6161.
[2025-03-08 01:42:40,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6161 states, 6160 states have (on average 1.2063311688311689) internal successors, (7431), 6160 states have internal predecessors, (7431), 0 states have call successors, (0), 0 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:40,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7431 transitions.
[2025-03-08 01:42:40,361 INFO  L78                 Accepts]: Start accepts. Automaton has 6161 states and 7431 transitions. Word has length 210
[2025-03-08 01:42:40,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:40,362 INFO  L471      AbstractCegarLoop]: Abstraction has 6161 states and 7431 transitions.
[2025-03-08 01:42:40,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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:40,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 6161 states and 7431 transitions.
[2025-03-08 01:42:40,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 01:42:40,364 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:40,364 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:40,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 01:42:40,364 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:40,365 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:40,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 2027221700, now seen corresponding path program 1 times
[2025-03-08 01:42:40,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:40,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023927374]
[2025-03-08 01:42:40,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:40,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:40,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 01:42:40,393 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 01:42:40,394 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:40,394 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:40,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-03-08 01:42:40,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:40,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023927374]
[2025-03-08 01:42:40,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023927374] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:40,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:40,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:40,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020316306]
[2025-03-08 01:42:40,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:40,534 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:40,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:40,535 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:40,535 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:40,535 INFO  L87              Difference]: Start difference. First operand 6161 states and 7431 transitions. Second operand  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:41,205 INFO  L93              Difference]: Finished difference Result 13249 states and 16226 transitions.
[2025-03-08 01:42:41,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:41,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 211
[2025-03-08 01:42:41,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:41,225 INFO  L225             Difference]: With dead ends: 13249
[2025-03-08 01:42:41,226 INFO  L226             Difference]: Without dead ends: 7459
[2025-03-08 01:42:41,232 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:41,233 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:41,233 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:41,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7459 states.
[2025-03-08 01:42:41,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 7265.
[2025-03-08 01:42:41,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7265 states, 7264 states have (on average 1.2014041850220265) internal successors, (8727), 7264 states have internal predecessors, (8727), 0 states have call successors, (0), 0 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,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 8727 transitions.
[2025-03-08 01:42:41,323 INFO  L78                 Accepts]: Start accepts. Automaton has 7265 states and 8727 transitions. Word has length 211
[2025-03-08 01:42:41,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:41,323 INFO  L471      AbstractCegarLoop]: Abstraction has 7265 states and 8727 transitions.
[2025-03-08 01:42:41,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 7265 states and 8727 transitions.
[2025-03-08 01:42:41,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 01:42:41,328 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:41,328 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:41,328 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 01:42:41,328 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:41,328 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:41,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -368895050, now seen corresponding path program 1 times
[2025-03-08 01:42:41,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:41,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254834210]
[2025-03-08 01:42:41,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:41,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:41,348 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 01:42:41,366 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 01:42:41,366 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:41,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:41,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:41,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:41,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254834210]
[2025-03-08 01:42:41,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254834210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:41,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:41,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:42:41,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283782737]
[2025-03-08 01:42:41,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:41,609 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:41,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:41,610 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:41,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:41,610 INFO  L87              Difference]: Start difference. First operand 7265 states and 8727 transitions. Second operand  has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 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,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:42,697 INFO  L93              Difference]: Finished difference Result 20643 states and 25402 transitions.
[2025-03-08 01:42:42,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:42,698 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231
[2025-03-08 01:42:42,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:42,732 INFO  L225             Difference]: With dead ends: 20643
[2025-03-08 01:42:42,732 INFO  L226             Difference]: Without dead ends: 13749
[2025-03-08 01:42:42,740 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:42,741 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 303 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:42,741 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 229 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 01:42:42,749 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13749 states.
[2025-03-08 01:42:42,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13745.
[2025-03-08 01:42:42,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13745 states, 13744 states have (on average 1.1905558789289872) internal successors, (16363), 13744 states have internal predecessors, (16363), 0 states have call successors, (0), 0 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,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13745 states to 13745 states and 16363 transitions.
[2025-03-08 01:42:42,893 INFO  L78                 Accepts]: Start accepts. Automaton has 13745 states and 16363 transitions. Word has length 231
[2025-03-08 01:42:42,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:42,893 INFO  L471      AbstractCegarLoop]: Abstraction has 13745 states and 16363 transitions.
[2025-03-08 01:42:42,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 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,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 13745 states and 16363 transitions.
[2025-03-08 01:42:42,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 242
[2025-03-08 01:42:42,896 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:42,896 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:42,897 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 01:42:42,897 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:42,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:42,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 116105071, now seen corresponding path program 1 times
[2025-03-08 01:42:42,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:42,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283750728]
[2025-03-08 01:42:42,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:42,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:42,926 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes.
[2025-03-08 01:42:42,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements.
[2025-03-08 01:42:42,947 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:42,947 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:43,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:43,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:43,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283750728]
[2025-03-08 01:42:43,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283750728] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:43,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:43,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:42:43,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675398081]
[2025-03-08 01:42:43,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:43,171 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:43,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:43,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:43,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:43,172 INFO  L87              Difference]: Start difference. First operand 13745 states and 16363 transitions. Second operand  has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:44,278 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:44,279 INFO  L93              Difference]: Finished difference Result 32287 states and 39114 transitions.
[2025-03-08 01:42:44,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:44,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241
[2025-03-08 01:42:44,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:44,310 INFO  L225             Difference]: With dead ends: 32287
[2025-03-08 01:42:44,310 INFO  L226             Difference]: Without dead ends: 18913
[2025-03-08 01:42:44,322 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:44,323 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 316 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:44,323 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 131 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 01:42:44,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18913 states.
[2025-03-08 01:42:44,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18913 to 18898.
[2025-03-08 01:42:44,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18898 states, 18897 states have (on average 1.198179605228343) internal successors, (22642), 18897 states have internal predecessors, (22642), 0 states have call successors, (0), 0 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:44,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 22642 transitions.
[2025-03-08 01:42:44,503 INFO  L78                 Accepts]: Start accepts. Automaton has 18898 states and 22642 transitions. Word has length 241
[2025-03-08 01:42:44,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:44,503 INFO  L471      AbstractCegarLoop]: Abstraction has 18898 states and 22642 transitions.
[2025-03-08 01:42:44,504 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:44,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 18898 states and 22642 transitions.
[2025-03-08 01:42:44,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-08 01:42:44,507 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:44,507 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:44,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 01:42:44,508 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:44,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:44,508 INFO  L85        PathProgramCache]: Analyzing trace with hash 1637469430, now seen corresponding path program 1 times
[2025-03-08 01:42:44,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:44,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374601964]
[2025-03-08 01:42:44,508 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:44,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:44,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-08 01:42:44,539 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-08 01:42:44,540 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:44,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:44,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 128 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-08 01:42:44,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:44,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374601964]
[2025-03-08 01:42:44,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374601964] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:44,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:44,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:44,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030836805]
[2025-03-08 01:42:44,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:44,672 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:44,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:44,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:44,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:44,673 INFO  L87              Difference]: Start difference. First operand 18898 states and 22642 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:45,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:45,342 INFO  L93              Difference]: Finished difference Result 37622 states and 45117 transitions.
[2025-03-08 01:42:45,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:45,343 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248
[2025-03-08 01:42:45,343 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:45,373 INFO  L225             Difference]: With dead ends: 37622
[2025-03-08 01:42:45,373 INFO  L226             Difference]: Without dead ends: 18910
[2025-03-08 01:42:45,391 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:45,391 INFO  L435           NwaCegarLoop]: 356 mSDtfsCounter, 172 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:45,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:45,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18910 states.
[2025-03-08 01:42:45,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18713.
[2025-03-08 01:42:45,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18713 states, 18712 states have (on average 1.1626763574177) internal successors, (21756), 18712 states have internal predecessors, (21756), 0 states have call successors, (0), 0 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,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18713 states to 18713 states and 21756 transitions.
[2025-03-08 01:42:45,685 INFO  L78                 Accepts]: Start accepts. Automaton has 18713 states and 21756 transitions. Word has length 248
[2025-03-08 01:42:45,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:45,685 INFO  L471      AbstractCegarLoop]: Abstraction has 18713 states and 21756 transitions.
[2025-03-08 01:42:45,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:45,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 18713 states and 21756 transitions.
[2025-03-08 01:42:45,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-03-08 01:42:45,689 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:45,690 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:45,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 01:42:45,690 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:45,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:45,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 1943649273, now seen corresponding path program 1 times
[2025-03-08 01:42:45,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:45,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727755314]
[2025-03-08 01:42:45,691 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:45,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:45,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-08 01:42:45,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-08 01:42:45,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:45,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:45,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:45,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:45,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727755314]
[2025-03-08 01:42:45,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727755314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:45,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:45,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:45,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944547853]
[2025-03-08 01:42:45,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:45,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:45,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:45,984 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:45,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:45,984 INFO  L87              Difference]: Start difference. First operand 18713 states and 21756 transitions. Second operand  has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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,919 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:46,919 INFO  L93              Difference]: Finished difference Result 39443 states and 46209 transitions.
[2025-03-08 01:42:46,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:46,920 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262
[2025-03-08 01:42:46,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:46,954 INFO  L225             Difference]: With dead ends: 39443
[2025-03-08 01:42:46,955 INFO  L226             Difference]: Without dead ends: 20548
[2025-03-08 01:42:46,969 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:46,970 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 194 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:46,970 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 179 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 01:42:46,985 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20548 states.
[2025-03-08 01:42:47,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 18323.
[2025-03-08 01:42:47,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18323 states, 18322 states have (on average 1.1256413055343304) internal successors, (20624), 18322 states have internal predecessors, (20624), 0 states have call successors, (0), 0 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,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20624 transitions.
[2025-03-08 01:42:47,210 INFO  L78                 Accepts]: Start accepts. Automaton has 18323 states and 20624 transitions. Word has length 262
[2025-03-08 01:42:47,211 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:47,211 INFO  L471      AbstractCegarLoop]: Abstraction has 18323 states and 20624 transitions.
[2025-03-08 01:42:47,211 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 18323 states and 20624 transitions.
[2025-03-08 01:42:47,219 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 297
[2025-03-08 01:42:47,219 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:47,219 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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,219 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 01:42:47,219 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:47,220 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:47,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -1968632706, now seen corresponding path program 1 times
[2025-03-08 01:42:47,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:47,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428411111]
[2025-03-08 01:42:47,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:47,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:47,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes.
[2025-03-08 01:42:47,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements.
[2025-03-08 01:42:47,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:47,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:47,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 303 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2025-03-08 01:42:47,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:47,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428411111]
[2025-03-08 01:42:47,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428411111] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:47,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:47,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:47,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020590801]
[2025-03-08 01:42:47,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:47,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:47,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:47,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:47,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:47,412 INFO  L87              Difference]: Start difference. First operand 18323 states and 20624 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:48,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:48,047 INFO  L93              Difference]: Finished difference Result 38295 states and 43086 transitions.
[2025-03-08 01:42:48,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:48,048 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 296
[2025-03-08 01:42:48,048 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:48,082 INFO  L225             Difference]: With dead ends: 38295
[2025-03-08 01:42:48,082 INFO  L226             Difference]: Without dead ends: 22370
[2025-03-08 01:42:48,095 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:48,096 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 193 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:48,096 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 148 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:42:48,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22370 states.
[2025-03-08 01:42:48,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 14082.
[2025-03-08 01:42:48,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14082 states, 14081 states have (on average 1.1337973155315673) internal successors, (15965), 14081 states have internal predecessors, (15965), 0 states have call successors, (0), 0 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:48,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 15965 transitions.
[2025-03-08 01:42:48,324 INFO  L78                 Accepts]: Start accepts. Automaton has 14082 states and 15965 transitions. Word has length 296
[2025-03-08 01:42:48,325 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:48,325 INFO  L471      AbstractCegarLoop]: Abstraction has 14082 states and 15965 transitions.
[2025-03-08 01:42:48,325 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:48,326 INFO  L276                IsEmpty]: Start isEmpty. Operand 14082 states and 15965 transitions.
[2025-03-08 01:42:48,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 310
[2025-03-08 01:42:48,331 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:48,332 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:48,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 01:42:48,332 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:48,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:48,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -1156186785, now seen corresponding path program 1 times
[2025-03-08 01:42:48,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:48,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937683257]
[2025-03-08 01:42:48,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:48,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:48,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes.
[2025-03-08 01:42:48,366 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements.
[2025-03-08 01:42:48,366 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:48,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:48,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:48,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:48,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937683257]
[2025-03-08 01:42:48,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937683257] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:48,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473116060]
[2025-03-08 01:42:48,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:48,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:48,686 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:48,689 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:48,690 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:48,734 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes.
[2025-03-08 01:42:48,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements.
[2025-03-08 01:42:48,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:48,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:48,784 INFO  L256         TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:48,789 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:48,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked.
[2025-03-08 01:42:48,849 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:42:48,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473116060] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:48,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:42:48,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-08 01:42:48,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952692487]
[2025-03-08 01:42:48,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:48,850 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:48,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:48,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:48,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:42:48,851 INFO  L87              Difference]: Start difference. First operand 14082 states and 15965 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:49,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:49,354 INFO  L93              Difference]: Finished difference Result 28898 states and 32763 transitions.
[2025-03-08 01:42:49,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:49,355 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309
[2025-03-08 01:42:49,355 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:49,370 INFO  L225             Difference]: With dead ends: 28898
[2025-03-08 01:42:49,370 INFO  L226             Difference]: Without dead ends: 14818
[2025-03-08 01:42:49,380 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 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:49,381 INFO  L435           NwaCegarLoop]: 355 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:49,381 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:49,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14818 states.
[2025-03-08 01:42:49,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 14450.
[2025-03-08 01:42:49,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14450 states, 14449 states have (on average 1.1314969894110318) internal successors, (16349), 14449 states have internal predecessors, (16349), 0 states have call successors, (0), 0 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,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14450 states to 14450 states and 16349 transitions.
[2025-03-08 01:42:49,576 INFO  L78                 Accepts]: Start accepts. Automaton has 14450 states and 16349 transitions. Word has length 309
[2025-03-08 01:42:49,577 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:49,577 INFO  L471      AbstractCegarLoop]: Abstraction has 14450 states and 16349 transitions.
[2025-03-08 01:42:49,577 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:49,577 INFO  L276                IsEmpty]: Start isEmpty. Operand 14450 states and 16349 transitions.
[2025-03-08 01:42:49,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 317
[2025-03-08 01:42:49,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:49,581 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:49,588 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:49,782 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:49,783 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:49,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:49,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -1078475730, now seen corresponding path program 1 times
[2025-03-08 01:42:49,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:49,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870424809]
[2025-03-08 01:42:49,784 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:49,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:49,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-03-08 01:42:49,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-03-08 01:42:49,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:49,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:50,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 338 backedges. 225 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 01:42:50,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:50,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870424809]
[2025-03-08 01:42:50,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870424809] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:50,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981447987]
[2025-03-08 01:42:50,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:50,272 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:50,272 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:50,275 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:50,277 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:50,320 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-03-08 01:42:50,368 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-03-08 01:42:50,368 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:50,368 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:50,370 INFO  L256         TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:50,380 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:50,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 338 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 01:42:50,856 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:42:50,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981447987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:50,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:42:50,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-03-08 01:42:50,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432131763]
[2025-03-08 01:42:50,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:50,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:50,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:50,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:50,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 01:42:50,857 INFO  L87              Difference]: Start difference. First operand 14450 states and 16349 transitions. Second operand  has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:51,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:51,567 INFO  L93              Difference]: Finished difference Result 33878 states and 38197 transitions.
[2025-03-08 01:42:51,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:51,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 316
[2025-03-08 01:42:51,569 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:51,590 INFO  L225             Difference]: With dead ends: 33878
[2025-03-08 01:42:51,591 INFO  L226             Difference]: Without dead ends: 19430
[2025-03-08 01:42:51,602 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 01:42:51,602 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:51,602 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 156 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:51,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19430 states.
[2025-03-08 01:42:51,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19430 to 19426.
[2025-03-08 01:42:51,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19426 states, 19425 states have (on average 1.1233976833976833) internal successors, (21822), 19425 states have internal predecessors, (21822), 0 states have call successors, (0), 0 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:51,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 21822 transitions.
[2025-03-08 01:42:51,790 INFO  L78                 Accepts]: Start accepts. Automaton has 19426 states and 21822 transitions. Word has length 316
[2025-03-08 01:42:51,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:51,791 INFO  L471      AbstractCegarLoop]: Abstraction has 19426 states and 21822 transitions.
[2025-03-08 01:42:51,791 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:51,791 INFO  L276                IsEmpty]: Start isEmpty. Operand 19426 states and 21822 transitions.
[2025-03-08 01:42:51,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 328
[2025-03-08 01:42:51,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:51,796 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:42:51,803 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:52,001 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,SelfDestructingSolverStorable13
[2025-03-08 01:42:52,002 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:52,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:52,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 613154714, now seen corresponding path program 1 times
[2025-03-08 01:42:52,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:52,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480760219]
[2025-03-08 01:42:52,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:52,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:52,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes.
[2025-03-08 01:42:52,078 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements.
[2025-03-08 01:42:52,078 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:52,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:52,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-03-08 01:42:52,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:52,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480760219]
[2025-03-08 01:42:52,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480760219] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:52,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:52,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:52,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289625287]
[2025-03-08 01:42:52,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:52,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:52,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:52,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:52,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:52,332 INFO  L87              Difference]: Start difference. First operand 19426 states and 21822 transitions. Second operand  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:53,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:53,101 INFO  L93              Difference]: Finished difference Result 39785 states and 44748 transitions.
[2025-03-08 01:42:53,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:53,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 327
[2025-03-08 01:42:53,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:53,127 INFO  L225             Difference]: With dead ends: 39785
[2025-03-08 01:42:53,127 INFO  L226             Difference]: Without dead ends: 22757
[2025-03-08 01:42:53,140 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:53,140 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:53,141 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 145 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:42:53,154 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22757 states.
[2025-03-08 01:42:53,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22757 to 19238.
[2025-03-08 01:42:53,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19238 states, 19237 states have (on average 1.1226282684410251) internal successors, (21596), 19237 states have internal predecessors, (21596), 0 states have call successors, (0), 0 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:53,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19238 states to 19238 states and 21596 transitions.
[2025-03-08 01:42:53,322 INFO  L78                 Accepts]: Start accepts. Automaton has 19238 states and 21596 transitions. Word has length 327
[2025-03-08 01:42:53,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:53,322 INFO  L471      AbstractCegarLoop]: Abstraction has 19238 states and 21596 transitions.
[2025-03-08 01:42:53,322 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:53,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 19238 states and 21596 transitions.
[2025-03-08 01:42:53,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 334
[2025-03-08 01:42:53,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:53,329 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,330 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 01:42:53,330 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:53,330 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:53,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -966157961, now seen corresponding path program 1 times
[2025-03-08 01:42:53,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:53,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455738671]
[2025-03-08 01:42:53,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:53,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:53,351 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes.
[2025-03-08 01:42:53,364 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements.
[2025-03-08 01:42:53,364 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:53,364 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:53,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 342 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-08 01:42:53,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:53,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455738671]
[2025-03-08 01:42:53,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455738671] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:53,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:53,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 01:42:53,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289580191]
[2025-03-08 01:42:53,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:53,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 01:42:53,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:53,682 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 01:42:53,682 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:53,683 INFO  L87              Difference]: Start difference. First operand 19238 states and 21596 transitions. Second operand  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:54,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:54,430 INFO  L93              Difference]: Finished difference Result 36926 states and 41514 transitions.
[2025-03-08 01:42:54,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 01:42:54,431 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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 333
[2025-03-08 01:42:54,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:54,448 INFO  L225             Difference]: With dead ends: 36926
[2025-03-08 01:42:54,448 INFO  L226             Difference]: Without dead ends: 17748
[2025-03-08 01:42:54,459 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:42:54,459 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 217 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:54,460 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 133 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:42:54,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17748 states.
[2025-03-08 01:42:54,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 17736.
[2025-03-08 01:42:54,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17736 states, 17735 states have (on average 1.1225260783760924) internal successors, (19908), 17735 states have internal predecessors, (19908), 0 states have call successors, (0), 0 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:54,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 19908 transitions.
[2025-03-08 01:42:54,591 INFO  L78                 Accepts]: Start accepts. Automaton has 17736 states and 19908 transitions. Word has length 333
[2025-03-08 01:42:54,591 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:54,591 INFO  L471      AbstractCegarLoop]: Abstraction has 17736 states and 19908 transitions.
[2025-03-08 01:42:54,591 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:54,591 INFO  L276                IsEmpty]: Start isEmpty. Operand 17736 states and 19908 transitions.
[2025-03-08 01:42:54,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-08 01:42:54,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:54,596 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:54,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 01:42:54,596 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:54,597 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:54,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -2033279819, now seen corresponding path program 1 times
[2025-03-08 01:42:54,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:54,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697824862]
[2025-03-08 01:42:54,597 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:54,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:54,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-08 01:42:54,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-08 01:42:54,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:54,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:54,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 355 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-03-08 01:42:54,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:54,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697824862]
[2025-03-08 01:42:54,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697824862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:54,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:54,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:42:54,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363471108]
[2025-03-08 01:42:54,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:54,880 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:42:54,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:54,881 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:42:54,881 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:42:54,881 INFO  L87              Difference]: Start difference. First operand 17736 states and 19908 transitions. Second operand  has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:55,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:55,752 INFO  L93              Difference]: Finished difference Result 38607 states and 43438 transitions.
[2025-03-08 01:42:55,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:42:55,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 338
[2025-03-08 01:42:55,753 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:55,775 INFO  L225             Difference]: With dead ends: 38607
[2025-03-08 01:42:55,775 INFO  L226             Difference]: Without dead ends: 21606
[2025-03-08 01:42:55,787 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:55,787 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 302 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:55,787 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 341 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 01:42:55,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21606 states.
[2025-03-08 01:42:55,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 17725.
[2025-03-08 01:42:55,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17725 states, 17724 states have (on average 1.0964793500338523) internal successors, (19434), 17724 states have internal predecessors, (19434), 0 states have call successors, (0), 0 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:55,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 19434 transitions.
[2025-03-08 01:42:55,930 INFO  L78                 Accepts]: Start accepts. Automaton has 17725 states and 19434 transitions. Word has length 338
[2025-03-08 01:42:55,930 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:55,930 INFO  L471      AbstractCegarLoop]: Abstraction has 17725 states and 19434 transitions.
[2025-03-08 01:42:55,930 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:55,930 INFO  L276                IsEmpty]: Start isEmpty. Operand 17725 states and 19434 transitions.
[2025-03-08 01:42:55,938 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 434
[2025-03-08 01:42:55,938 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:55,938 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:55,938 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 01:42:55,938 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:55,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:55,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 969621254, now seen corresponding path program 1 times
[2025-03-08 01:42:55,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:55,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308366895]
[2025-03-08 01:42:55,939 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:55,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:55,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes.
[2025-03-08 01:42:55,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements.
[2025-03-08 01:42:55,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:55,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:56,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 637 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-03-08 01:42:56,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:56,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308366895]
[2025-03-08 01:42:56,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308366895] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:42:56,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:42:56,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:42:56,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014892480]
[2025-03-08 01:42:56,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:42:56,105 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:42:56,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:42:56,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:42:56,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:42:56,105 INFO  L87              Difference]: Start difference. First operand 17725 states and 19434 transitions. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:56,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:42:56,538 INFO  L93              Difference]: Finished difference Result 37288 states and 40946 transitions.
[2025-03-08 01:42:56,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:42:56,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433
[2025-03-08 01:42:56,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:42:56,558 INFO  L225             Difference]: With dead ends: 37288
[2025-03-08 01:42:56,558 INFO  L226             Difference]: Without dead ends: 19933
[2025-03-08 01:42:56,621 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:56,622 INFO  L435           NwaCegarLoop]: 327 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:42:56,622 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 351 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:42:56,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19933 states.
[2025-03-08 01:42:56,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 18829.
[2025-03-08 01:42:56,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18829 states, 18828 states have (on average 1.0929997875504567) internal successors, (20579), 18828 states have internal predecessors, (20579), 0 states have call successors, (0), 0 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:56,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18829 states to 18829 states and 20579 transitions.
[2025-03-08 01:42:56,744 INFO  L78                 Accepts]: Start accepts. Automaton has 18829 states and 20579 transitions. Word has length 433
[2025-03-08 01:42:56,744 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:42:56,744 INFO  L471      AbstractCegarLoop]: Abstraction has 18829 states and 20579 transitions.
[2025-03-08 01:42:56,744 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:42:56,744 INFO  L276                IsEmpty]: Start isEmpty. Operand 18829 states and 20579 transitions.
[2025-03-08 01:42:56,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 442
[2025-03-08 01:42:56,753 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:42:56,753 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:42:56,754 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 01:42:56,754 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:42:56,754 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:42:56,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 1525603539, now seen corresponding path program 1 times
[2025-03-08 01:42:56,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:42:56,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014112095]
[2025-03-08 01:42:56,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:56,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:42:56,779 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes.
[2025-03-08 01:42:56,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements.
[2025-03-08 01:42:56,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:56,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:57,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:57,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:42:57,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014112095]
[2025-03-08 01:42:57,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014112095] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:42:57,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003407757]
[2025-03-08 01:42:57,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:42:57,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:42:57,593 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:42:57,597 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:57,600 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:57,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes.
[2025-03-08 01:42:57,700 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements.
[2025-03-08 01:42:57,700 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:42:57,700 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:42:57,701 INFO  L256         TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 01:42:57,706 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:42:58,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:42:58,833 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 01:43:01,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 413 backedges. 170 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:43:01,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003407757] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 01:43:01,427 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 01:43:01,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12
[2025-03-08 01:43:01,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519901615]
[2025-03-08 01:43:01,427 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 01:43:01,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 01:43:01,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:01,429 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 01:43:01,429 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156
[2025-03-08 01:43:01,429 INFO  L87              Difference]: Start difference. First operand 18829 states and 20579 transitions. Second operand  has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:43:05,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:05,142 INFO  L93              Difference]: Finished difference Result 41708 states and 45568 transitions.
[2025-03-08 01:43:05,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 01:43:05,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 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 441
[2025-03-08 01:43:05,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:05,195 INFO  L225             Difference]: With dead ends: 41708
[2025-03-08 01:43:05,196 INFO  L226             Difference]: Without dead ends: 25275
[2025-03-08 01:43:05,210 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380
[2025-03-08 01:43:05,210 INFO  L435           NwaCegarLoop]: 35 mSDtfsCounter, 1383 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 6268 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 6268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:05,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 212 Invalid, 6760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 6268 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-03-08 01:43:05,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25275 states.
[2025-03-08 01:43:05,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25275 to 20113.
[2025-03-08 01:43:05,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20113 states, 20112 states have (on average 1.0893993635640413) internal successors, (21910), 20112 states have internal predecessors, (21910), 0 states have call successors, (0), 0 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:43:05,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20113 states to 20113 states and 21910 transitions.
[2025-03-08 01:43:05,501 INFO  L78                 Accepts]: Start accepts. Automaton has 20113 states and 21910 transitions. Word has length 441
[2025-03-08 01:43:05,501 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:05,501 INFO  L471      AbstractCegarLoop]: Abstraction has 20113 states and 21910 transitions.
[2025-03-08 01:43:05,501 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:43:05,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 20113 states and 21910 transitions.
[2025-03-08 01:43:05,518 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 532
[2025-03-08 01:43:05,518 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:43:05,518 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:43:05,525 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 01:43:05,718 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:43:05,719 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:43:05,719 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:43:05,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 1106472777, now seen corresponding path program 1 times
[2025-03-08 01:43:05,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:43:05,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958280002]
[2025-03-08 01:43:05,720 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:43:05,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:43:05,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes.
[2025-03-08 01:43:05,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements.
[2025-03-08 01:43:05,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:43:05,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:43:05,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 782 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked.
[2025-03-08 01:43:05,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:43:05,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958280002]
[2025-03-08 01:43:05,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958280002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:43:05,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:43:05,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:43:05,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901630066]
[2025-03-08 01:43:05,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:43:05,941 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:43:05,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:05,942 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:43:05,942 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:43:05,942 INFO  L87              Difference]: Start difference. First operand 20113 states and 21910 transitions. Second operand  has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:43:06,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:06,692 INFO  L93              Difference]: Finished difference Result 39130 states and 42644 transitions.
[2025-03-08 01:43:06,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:43:06,692 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 531
[2025-03-08 01:43:06,692 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:06,712 INFO  L225             Difference]: With dead ends: 39130
[2025-03-08 01:43:06,712 INFO  L226             Difference]: Without dead ends: 21781
[2025-03-08 01:43:06,724 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:43:06,724 INFO  L435           NwaCegarLoop]: 28 mSDtfsCounter, 166 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:06,724 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 63 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:43:06,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21781 states.
[2025-03-08 01:43:06,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 19929.
[2025-03-08 01:43:06,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19929 states, 19928 states have (on average 1.0882677639502207) internal successors, (21687), 19928 states have internal predecessors, (21687), 0 states have call successors, (0), 0 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:43:06,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19929 states to 19929 states and 21687 transitions.
[2025-03-08 01:43:06,888 INFO  L78                 Accepts]: Start accepts. Automaton has 19929 states and 21687 transitions. Word has length 531
[2025-03-08 01:43:06,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:06,889 INFO  L471      AbstractCegarLoop]: Abstraction has 19929 states and 21687 transitions.
[2025-03-08 01:43:06,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:43:06,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 19929 states and 21687 transitions.
[2025-03-08 01:43:06,900 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 546
[2025-03-08 01:43:06,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:43:06,901 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:43:06,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 01:43:06,901 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:43:06,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:43:06,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -1102497269, now seen corresponding path program 1 times
[2025-03-08 01:43:06,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:43:06,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213281723]
[2025-03-08 01:43:06,901 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:43:06,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:43:06,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes.
[2025-03-08 01:43:06,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements.
[2025-03-08 01:43:06,951 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:43:06,951 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:43:07,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked.
[2025-03-08 01:43:07,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:43:07,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213281723]
[2025-03-08 01:43:07,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213281723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:43:07,174 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:43:07,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:43:07,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700649241]
[2025-03-08 01:43:07,174 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:43:07,175 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:43:07,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:07,175 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:43:07,175 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:43:07,175 INFO  L87              Difference]: Start difference. First operand 19929 states and 21687 transitions. Second operand  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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:43:07,798 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:07,798 INFO  L93              Difference]: Finished difference Result 37845 states and 41169 transitions.
[2025-03-08 01:43:07,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:43:07,799 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 545
[2025-03-08 01:43:07,799 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:07,817 INFO  L225             Difference]: With dead ends: 37845
[2025-03-08 01:43:07,817 INFO  L226             Difference]: Without dead ends: 20496
[2025-03-08 01:43:07,828 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:43:07,829 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:07,829 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 150 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:43:07,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20496 states.
[2025-03-08 01:43:07,935 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20496 to 12931.
[2025-03-08 01:43:07,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12931 states, 12930 states have (on average 1.0876256767208043) internal successors, (14063), 12930 states have internal predecessors, (14063), 0 states have call successors, (0), 0 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:43:07,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12931 states to 12931 states and 14063 transitions.
[2025-03-08 01:43:07,957 INFO  L78                 Accepts]: Start accepts. Automaton has 12931 states and 14063 transitions. Word has length 545
[2025-03-08 01:43:07,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:07,957 INFO  L471      AbstractCegarLoop]: Abstraction has 12931 states and 14063 transitions.
[2025-03-08 01:43:07,957 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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:43:07,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 12931 states and 14063 transitions.
[2025-03-08 01:43:07,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 547
[2025-03-08 01:43:07,964 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:43:07,964 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:43:07,964 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 01:43:07,964 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:43:07,965 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:43:07,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -1589998242, now seen corresponding path program 1 times
[2025-03-08 01:43:07,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:43:07,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243090010]
[2025-03-08 01:43:07,965 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:43:07,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:43:07,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes.
[2025-03-08 01:43:08,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements.
[2025-03-08 01:43:08,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:43:08,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:43:08,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked.
[2025-03-08 01:43:08,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:43:08,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243090010]
[2025-03-08 01:43:08,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243090010] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:43:08,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:43:08,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:43:08,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256543654]
[2025-03-08 01:43:08,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:43:08,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:43:08,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:08,117 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:43:08,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:43:08,117 INFO  L87              Difference]: Start difference. First operand 12931 states and 14063 transitions. Second operand  has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:43:08,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:08,628 INFO  L93              Difference]: Finished difference Result 27148 states and 29461 transitions.
[2025-03-08 01:43:08,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:43:08,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 546
[2025-03-08 01:43:08,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:08,644 INFO  L225             Difference]: With dead ends: 27148
[2025-03-08 01:43:08,644 INFO  L226             Difference]: Without dead ends: 14035
[2025-03-08 01:43:08,653 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:43:08,655 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:08,655 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 129 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:43:08,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14035 states.
[2025-03-08 01:43:08,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14035 to 11821.
[2025-03-08 01:43:08,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11821 states, 11820 states have (on average 1.0866328257191202) internal successors, (12844), 11820 states have internal predecessors, (12844), 0 states have call successors, (0), 0 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:43:08,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 12844 transitions.
[2025-03-08 01:43:08,775 INFO  L78                 Accepts]: Start accepts. Automaton has 11821 states and 12844 transitions. Word has length 546
[2025-03-08 01:43:08,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:08,775 INFO  L471      AbstractCegarLoop]: Abstraction has 11821 states and 12844 transitions.
[2025-03-08 01:43:08,775 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:43:08,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 11821 states and 12844 transitions.
[2025-03-08 01:43:08,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 597
[2025-03-08 01:43:08,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:43:08,785 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 01:43:08,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 01:43:08,786 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:43:08,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:43:08,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 640882642, now seen corresponding path program 1 times
[2025-03-08 01:43:08,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:43:08,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628459821]
[2025-03-08 01:43:08,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:43:08,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:43:08,826 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes.
[2025-03-08 01:43:08,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements.
[2025-03-08 01:43:08,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:43:08,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:43:09,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 1103 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked.
[2025-03-08 01:43:09,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:43:09,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628459821]
[2025-03-08 01:43:09,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628459821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:43:09,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:43:09,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:43:09,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274975637]
[2025-03-08 01:43:09,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:43:09,087 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:43:09,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:09,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:43:09,088 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:43:09,088 INFO  L87              Difference]: Start difference. First operand 11821 states and 12844 transitions. Second operand  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 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:43:09,583 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:09,583 INFO  L93              Difference]: Finished difference Result 22899 states and 24838 transitions.
[2025-03-08 01:43:09,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:43:09,583 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 596
[2025-03-08 01:43:09,584 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:09,593 INFO  L225             Difference]: With dead ends: 22899
[2025-03-08 01:43:09,593 INFO  L226             Difference]: Without dead ends: 11080
[2025-03-08 01:43:09,600 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:43:09,600 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:09,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:43:09,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11080 states.
[2025-03-08 01:43:09,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11080 to 11080.
[2025-03-08 01:43:09,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11080 states, 11079 states have (on average 1.0778951168878057) internal successors, (11942), 11079 states have internal predecessors, (11942), 0 states have call successors, (0), 0 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:43:09,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 11942 transitions.
[2025-03-08 01:43:09,718 INFO  L78                 Accepts]: Start accepts. Automaton has 11080 states and 11942 transitions. Word has length 596
[2025-03-08 01:43:09,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:09,718 INFO  L471      AbstractCegarLoop]: Abstraction has 11080 states and 11942 transitions.
[2025-03-08 01:43:09,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 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:43:09,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 11080 states and 11942 transitions.
[2025-03-08 01:43:09,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 680
[2025-03-08 01:43:09,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:43:09,732 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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]
[2025-03-08 01:43:09,732 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 01:43:09,732 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:43:09,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:43:09,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 500796150, now seen corresponding path program 1 times
[2025-03-08 01:43:09,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:43:09,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764239679]
[2025-03-08 01:43:09,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:43:09,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:43:09,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes.
[2025-03-08 01:43:09,827 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements.
[2025-03-08 01:43:09,827 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:43:09,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:43:09,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 1521 backedges. 979 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked.
[2025-03-08 01:43:09,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:43:09,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764239679]
[2025-03-08 01:43:09,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764239679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:43:09,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:43:09,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:43:09,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790212471]
[2025-03-08 01:43:09,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:43:09,970 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:43:09,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:43:09,970 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:43:09,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:43:09,970 INFO  L87              Difference]: Start difference. First operand 11080 states and 11942 transitions. Second operand  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:43:10,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:43:10,426 INFO  L93              Difference]: Finished difference Result 22155 states and 23845 transitions.
[2025-03-08 01:43:10,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:43:10,426 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 679
[2025-03-08 01:43:10,427 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:43:10,428 INFO  L225             Difference]: With dead ends: 22155
[2025-03-08 01:43:10,428 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 01:43:10,435 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:43:10,436 INFO  L435           NwaCegarLoop]: 291 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:43:10,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 306 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:43:10,436 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 01:43:10,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 01:43:10,437 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:43:10,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 01:43:10,437 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 679
[2025-03-08 01:43:10,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:43:10,437 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 01:43:10,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:43:10,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 01:43:10,438 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 01:43:10,440 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 01:43:10,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 01:43:10,443 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]
[2025-03-08 01:43:10,445 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 01:43:17,058 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 01:43:17,077 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:43:17 BoogieIcfgContainer
[2025-03-08 01:43:17,077 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 01:43:17,078 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 01:43:17,078 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 01:43:17,078 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 01:43:17,078 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:33" (3/4) ...
[2025-03-08 01:43:17,080 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 01:43:17,104 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-08 01:43:17,105 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 01:43:17,106 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 01:43:17,106 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 01:43:17,223 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 01:43:17,223 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 01:43:17,223 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 01:43:17,224 INFO  L158              Benchmark]: Toolchain (without parser) took 45774.63ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 103.7MB in the beginning and 65.0MB in the end (delta: 38.7MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,224 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 01:43:17,224 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 487.95ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 60.4MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,225 INFO  L158              Benchmark]: Boogie Procedure Inliner took 87.80ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 43.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,225 INFO  L158              Benchmark]: Boogie Preprocessor took 139.42ms. Allocated memory is still 142.6MB. Free memory was 43.6MB in the beginning and 82.0MB in the end (delta: -38.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,225 INFO  L158              Benchmark]: IcfgBuilder took 1348.10ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 40.6MB in the end (delta: 41.4MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,225 INFO  L158              Benchmark]: TraceAbstraction took 43560.34ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 39.4MB in the beginning and 81.7MB in the end (delta: -42.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,225 INFO  L158              Benchmark]: Witness Printer took 145.66ms. Allocated memory is still 419.4MB. Free memory was 81.7MB in the beginning and 65.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 01:43:17,226 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 487.95ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 60.4MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 87.80ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 43.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 139.42ms. Allocated memory is still 142.6MB. Free memory was 43.6MB in the beginning and 82.0MB in the end (delta: -38.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1348.10ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 40.6MB in the end (delta: 41.4MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 43560.34ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 39.4MB in the beginning and 81.7MB in the end (delta: -42.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
 * Witness Printer took 145.66ms. Allocated memory is still 419.4MB. Free memory was 81.7MB in the beginning and 65.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. 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: 103]: 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: 36.9s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6123 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6123 mSDsluCounter, 5460 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 915 mSDsCounter, 2603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24108 IncrementalHoareTripleChecker+Invalid, 26711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2603 mSolverCounterUnsat, 4545 mSDtfsCounter, 24108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 1532 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20113occurred in iteration=19, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 36653 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 8748 NumberOfCodeBlocks, 8748 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 9161 ConstructedInterpolants, 0 QuantifiedInterpolants, 37968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 9583/10506 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: (((((((((((((((((((((((((((a23 <= 262) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a29 + 275802) <= 0) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a23 + 127601) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a3 == 1) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (13 <= a25))) || (((((((570382 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751)))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a3 == 1) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || ((((((a29 <= 140) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15))) || ((((((a3 == 1) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751))) && (13 <= a25))) || (((((a25 <= 10) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a29 <= 130))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 01:43:17,248 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