./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label25.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/Problem16_label25.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 b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 02:04:39,649 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 02:04:39,709 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 02:04:39,713 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 02:04:39,713 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 02:04:39,738 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 02:04:39,739 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 02:04:39,739 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 02:04:39,740 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 02:04:39,740 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 02:04:39,741 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 02:04:39,741 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 02:04:39,741 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 02:04:39,741 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 02:04:39,742 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 02:04:39,742 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 02:04:39,743 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 02:04:39,743 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:04:39,744 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 02:04:39,744 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 02:04:39,745 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 02:04:39,745 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 02:04:39,745 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 -> b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77
[2025-03-08 02:04:39,971 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 02:04:39,980 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 02:04:39,982 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 02:04:39,983 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 02:04:39,983 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 02:04:39,985 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label25.c
[2025-03-08 02:04:41,180 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7250eb/610e454a5c0646be9c3c1a560376af8e/FLAGe6894b55c
[2025-03-08 02:04:41,492 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 02:04:41,493 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c
[2025-03-08 02:04:41,508 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7250eb/610e454a5c0646be9c3c1a560376af8e/FLAGe6894b55c
[2025-03-08 02:04:41,729 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7250eb/610e454a5c0646be9c3c1a560376af8e
[2025-03-08 02:04:41,732 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 02:04:41,733 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 02:04:41,734 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 02:04:41,734 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 02:04:41,740 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 02:04:41,741 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:41" (1/1) ...
[2025-03-08 02:04:41,742 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:41, skipping insertion in model container
[2025-03-08 02:04:41,743 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:41" (1/1) ...
[2025-03-08 02:04:41,789 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 02:04:41,940 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/Problem16_label25.c[5318,5331]
[2025-03-08 02:04:42,181 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:04:42,189 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 02:04:42,200 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/Problem16_label25.c[5318,5331]
[2025-03-08 02:04:42,314 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:04:42,326 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 02:04:42,327 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42 WrapperNode
[2025-03-08 02:04:42,328 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 02:04:42,329 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 02:04:42,329 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 02:04:42,329 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 02:04:42,334 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,359 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,438 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-03-08 02:04:42,438 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 02:04:42,439 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 02:04:42,439 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 02:04:42,439 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 02:04:42,445 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,446 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,496 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,533 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 02:04:42,533 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,533 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,564 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,572 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,579 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,589 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,602 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 02:04:42,603 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 02:04:42,604 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 02:04:42,604 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 02:04:42,605 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (1/1) ...
[2025-03-08 02:04:42,609 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:04:42,619 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:04:42,631 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 02:04:42,637 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 02:04:42,654 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 02:04:42,654 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 02:04:42,655 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 02:04:42,655 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 02:04:42,697 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 02:04:42,699 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 02:04:44,181 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-03-08 02:04:44,248 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-03-08 02:04:44,248 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 02:04:44,264 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 02:04:44,265 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 02:04:44,265 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:44 BoogieIcfgContainer
[2025-03-08 02:04:44,265 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 02:04:44,267 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 02:04:44,267 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 02:04:44,271 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 02:04:44,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:04:41" (1/3) ...
[2025-03-08 02:04:44,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:44, skipping insertion in model container
[2025-03-08 02:04:44,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:42" (2/3) ...
[2025-03-08 02:04:44,273 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:44, skipping insertion in model container
[2025-03-08 02:04:44,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:44" (3/3) ...
[2025-03-08 02:04:44,274 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label25.c
[2025-03-08 02:04:44,285 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 02:04:44,287 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label25.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 02:04:44,348 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 02:04:44,357 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;@5aac2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 02:04:44,358 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 02:04:44,364 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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 02:04:44,369 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2025-03-08 02:04:44,371 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:44,371 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:04:44,372 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:44,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:44,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1464985316, now seen corresponding path program 1 times
[2025-03-08 02:04:44,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:44,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20303042]
[2025-03-08 02:04:44,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:44,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:44,438 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-03-08 02:04:44,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-03-08 02:04:44,474 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:44,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:44,651 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 02:04:44,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:44,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20303042]
[2025-03-08 02:04:44,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20303042] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:44,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:44,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:04:44,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750896400]
[2025-03-08 02:04:44,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:44,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:44,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:44,674 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:44,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:44,677 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 02:04:46,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:46,039 INFO  L93              Difference]: Finished difference Result 1122 states and 2100 transitions.
[2025-03-08 02:04:46,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:46,042 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50
[2025-03-08 02:04:46,042 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:46,050 INFO  L225             Difference]: With dead ends: 1122
[2025-03-08 02:04:46,052 INFO  L226             Difference]: Without dead ends: 662
[2025-03-08 02:04:46,055 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 02:04:46,057 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 337 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:46,057 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:04:46,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2025-03-08 02:04:46,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2025-03-08 02:04:46,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 02:04:46,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions.
[2025-03-08 02:04:46,114 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 50
[2025-03-08 02:04:46,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:46,114 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions.
[2025-03-08 02:04:46,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 02:04:46,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions.
[2025-03-08 02:04:46,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-08 02:04:46,118 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:46,118 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 02:04:46,118 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 02:04:46,118 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:46,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:46,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -880689080, now seen corresponding path program 1 times
[2025-03-08 02:04:46,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:46,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740088008]
[2025-03-08 02:04:46,119 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:46,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:46,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-08 02:04:46,167 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-08 02:04:46,167 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:46,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:46,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:04:46,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:46,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740088008]
[2025-03-08 02:04:46,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740088008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:46,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:46,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:46,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772066993]
[2025-03-08 02:04:46,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:46,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:04:46,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:46,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:04:46,424 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:04:46,424 INFO  L87              Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand  has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 02:04:48,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:48,102 INFO  L93              Difference]: Finished difference Result 2309 states and 3414 transitions.
[2025-03-08 02:04:48,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:04:48,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118
[2025-03-08 02:04:48,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:48,108 INFO  L225             Difference]: With dead ends: 2309
[2025-03-08 02:04:48,108 INFO  L226             Difference]: Without dead ends: 1649
[2025-03-08 02:04:48,110 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 02:04:48,111 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:48,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 02:04:48,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2025-03-08 02:04:48,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649.
[2025-03-08 02:04:48,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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 02:04:48,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions.
[2025-03-08 02:04:48,153 INFO  L78                 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 118
[2025-03-08 02:04:48,153 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:48,154 INFO  L471      AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions.
[2025-03-08 02:04:48,155 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 02:04:48,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions.
[2025-03-08 02:04:48,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2025-03-08 02:04:48,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:48,158 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:48,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 02:04:48,159 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:48,159 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:48,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 1664371818, now seen corresponding path program 1 times
[2025-03-08 02:04:48,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:48,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945536802]
[2025-03-08 02:04:48,159 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:48,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:48,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes.
[2025-03-08 02:04:48,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements.
[2025-03-08 02:04:48,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:48,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:48,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:04:48,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:48,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945536802]
[2025-03-08 02:04:48,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945536802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:48,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:48,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:04:48,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019756993]
[2025-03-08 02:04:48,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:48,345 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:48,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:48,345 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:48,345 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:48,346 INFO  L87              Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 02:04:49,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:49,385 INFO  L93              Difference]: Finished difference Result 3625 states and 5242 transitions.
[2025-03-08 02:04:49,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:49,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 181
[2025-03-08 02:04:49,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:49,393 INFO  L225             Difference]: With dead ends: 3625
[2025-03-08 02:04:49,393 INFO  L226             Difference]: Without dead ends: 2307
[2025-03-08 02:04:49,394 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 02:04:49,395 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:49,395 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 02:04:49,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2025-03-08 02:04:49,426 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307.
[2025-03-08 02:04:49,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 0 states have call successors, (0), 0 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 02:04:49,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions.
[2025-03-08 02:04:49,434 INFO  L78                 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 181
[2025-03-08 02:04:49,435 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:49,435 INFO  L471      AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions.
[2025-03-08 02:04:49,435 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 02:04:49,435 INFO  L276                IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions.
[2025-03-08 02:04:49,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-08 02:04:49,437 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:49,437 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:04:49,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 02:04:49,437 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:49,437 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:49,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1338943152, now seen corresponding path program 1 times
[2025-03-08 02:04:49,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:49,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408986139]
[2025-03-08 02:04:49,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:49,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:49,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-08 02:04:49,484 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-08 02:04:49,484 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:49,484 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:49,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-03-08 02:04:49,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:49,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408986139]
[2025-03-08 02:04:49,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408986139] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:49,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:49,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:04:49,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696935279]
[2025-03-08 02:04:49,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:49,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:49,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:49,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:49,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:49,624 INFO  L87              Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 02:04:50,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:50,539 INFO  L93              Difference]: Finished difference Result 5599 states and 7699 transitions.
[2025-03-08 02:04:50,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:50,540 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 216
[2025-03-08 02:04:50,541 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:50,550 INFO  L225             Difference]: With dead ends: 5599
[2025-03-08 02:04:50,551 INFO  L226             Difference]: Without dead ends: 3623
[2025-03-08 02:04:50,552 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 02:04:50,556 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:50,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:04:50,560 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-03-08 02:04:50,595 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965.
[2025-03-08 02:04:50,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 0 states have call successors, (0), 0 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 02:04:50,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions.
[2025-03-08 02:04:50,604 INFO  L78                 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 216
[2025-03-08 02:04:50,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:50,605 INFO  L471      AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions.
[2025-03-08 02:04:50,605 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 02:04:50,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions.
[2025-03-08 02:04:50,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 02:04:50,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:50,607 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:04:50,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 02:04:50,608 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:50,608 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:50,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -10898434, now seen corresponding path program 1 times
[2025-03-08 02:04:50,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:50,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443230273]
[2025-03-08 02:04:50,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:50,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:50,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 02:04:50,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 02:04:50,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:50,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:50,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:04:50,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:50,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443230273]
[2025-03-08 02:04:50,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443230273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:50,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:50,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:50,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550188752]
[2025-03-08 02:04:50,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:50,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:50,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:50,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:50,758 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:50,758 INFO  L87              Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand  has 3 states, 3 states have (on average 77.66666666666667) 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 02:04:51,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:51,713 INFO  L93              Difference]: Finished difference Result 6915 states and 8657 transitions.
[2025-03-08 02:04:51,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:51,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.66666666666667) 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 233
[2025-03-08 02:04:51,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:51,722 INFO  L225             Difference]: With dead ends: 6915
[2025-03-08 02:04:51,723 INFO  L226             Difference]: Without dead ends: 3623
[2025-03-08 02:04:51,726 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 02:04:51,728 INFO  L435           NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:51,728 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:04:51,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3623 states.
[2025-03-08 02:04:51,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623.
[2025-03-08 02:04:51,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3623 states, 3622 states have (on average 1.0762009939260078) internal successors, (3898), 3622 states have internal predecessors, (3898), 0 states have call successors, (0), 0 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 02:04:51,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3898 transitions.
[2025-03-08 02:04:51,774 INFO  L78                 Accepts]: Start accepts. Automaton has 3623 states and 3898 transitions. Word has length 233
[2025-03-08 02:04:51,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:51,775 INFO  L471      AbstractCegarLoop]: Abstraction has 3623 states and 3898 transitions.
[2025-03-08 02:04:51,775 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.66666666666667) 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 02:04:51,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 3623 states and 3898 transitions.
[2025-03-08 02:04:51,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 286
[2025-03-08 02:04:51,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:51,777 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:51,777 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 02:04:51,777 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:51,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:51,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -942275994, now seen corresponding path program 1 times
[2025-03-08 02:04:51,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:51,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135094157]
[2025-03-08 02:04:51,779 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:51,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:51,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-03-08 02:04:51,822 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-03-08 02:04:51,824 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:51,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:52,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-08 02:04:52,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:52,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135094157]
[2025-03-08 02:04:52,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135094157] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:04:52,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936741957]
[2025-03-08 02:04:52,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:52,134 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:04:52,134 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:04:52,138 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 02:04:52,140 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 02:04:52,195 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-03-08 02:04:52,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-03-08 02:04:52,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:52,246 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:52,249 INFO  L256         TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:04:52,257 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:04:52,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:04:52,358 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:04:52,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [936741957] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:52,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:04:52,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-08 02:04:52,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166623609]
[2025-03-08 02:04:52,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:52,359 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:52,359 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:52,360 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:52,360 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:04:52,360 INFO  L87              Difference]: Start difference. First operand 3623 states and 3898 transitions. Second operand  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 02:04:53,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:53,121 INFO  L93              Difference]: Finished difference Result 9876 states and 10678 transitions.
[2025-03-08 02:04:53,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:53,121 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285
[2025-03-08 02:04:53,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:53,136 INFO  L225             Difference]: With dead ends: 9876
[2025-03-08 02:04:53,136 INFO  L226             Difference]: Without dead ends: 6584
[2025-03-08 02:04:53,141 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 02:04:53,141 INFO  L435           NwaCegarLoop]: 38 mSDtfsCounter, 286 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:53,141 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 43 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 02:04:53,148 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6584 states.
[2025-03-08 02:04:53,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6255.
[2025-03-08 02:04:53,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6255 states, 6254 states have (on average 1.0749920051167252) internal successors, (6723), 6254 states have internal predecessors, (6723), 0 states have call successors, (0), 0 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 02:04:53,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6723 transitions.
[2025-03-08 02:04:53,218 INFO  L78                 Accepts]: Start accepts. Automaton has 6255 states and 6723 transitions. Word has length 285
[2025-03-08 02:04:53,218 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:53,218 INFO  L471      AbstractCegarLoop]: Abstraction has 6255 states and 6723 transitions.
[2025-03-08 02:04:53,218 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 02:04:53,219 INFO  L276                IsEmpty]: Start isEmpty. Operand 6255 states and 6723 transitions.
[2025-03-08 02:04:53,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 445
[2025-03-08 02:04:53,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:53,227 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:04:53,234 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 02:04:53,427 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,SelfDestructingSolverStorable5
[2025-03-08 02:04:53,428 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:53,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:53,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951276006, now seen corresponding path program 1 times
[2025-03-08 02:04:53,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:53,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966805915]
[2025-03-08 02:04:53,428 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:53,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:53,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes.
[2025-03-08 02:04:53,497 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements.
[2025-03-08 02:04:53,498 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:53,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:53,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 253 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:04:53,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:53,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966805915]
[2025-03-08 02:04:53,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966805915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:53,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:53,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:53,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718240277]
[2025-03-08 02:04:53,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:53,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:53,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:53,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:53,701 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:53,702 INFO  L87              Difference]: Start difference. First operand 6255 states and 6723 transitions. Second operand  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 02:04:54,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:54,399 INFO  L93              Difference]: Finished difference Result 14482 states and 15619 transitions.
[2025-03-08 02:04:54,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:54,399 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 444
[2025-03-08 02:04:54,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:54,417 INFO  L225             Difference]: With dead ends: 14482
[2025-03-08 02:04:54,417 INFO  L226             Difference]: Without dead ends: 8558
[2025-03-08 02:04:54,423 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 02:04:54,424 INFO  L435           NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:54,424 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 67 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:04:54,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8558 states.
[2025-03-08 02:04:54,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8229.
[2025-03-08 02:04:54,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8229 states, 8228 states have (on average 1.0656295576081671) internal successors, (8768), 8228 states have internal predecessors, (8768), 0 states have call successors, (0), 0 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 02:04:54,544 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8768 transitions.
[2025-03-08 02:04:54,544 INFO  L78                 Accepts]: Start accepts. Automaton has 8229 states and 8768 transitions. Word has length 444
[2025-03-08 02:04:54,545 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:54,545 INFO  L471      AbstractCegarLoop]: Abstraction has 8229 states and 8768 transitions.
[2025-03-08 02:04:54,545 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 02:04:54,545 INFO  L276                IsEmpty]: Start isEmpty. Operand 8229 states and 8768 transitions.
[2025-03-08 02:04:54,549 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 447
[2025-03-08 02:04:54,549 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:54,549 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:04:54,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 02:04:54,550 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:54,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:54,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 535642877, now seen corresponding path program 1 times
[2025-03-08 02:04:54,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:54,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311737821]
[2025-03-08 02:04:54,550 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:54,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:54,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes.
[2025-03-08 02:04:54,602 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements.
[2025-03-08 02:04:54,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:54,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:54,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 247 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked.
[2025-03-08 02:04:54,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:54,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311737821]
[2025-03-08 02:04:54,797 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311737821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:54,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:54,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:54,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708433462]
[2025-03-08 02:04:54,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:54,798 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:54,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:54,798 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:54,798 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:54,798 INFO  L87              Difference]: Start difference. First operand 8229 states and 8768 transitions. Second operand  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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 02:04:55,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:55,452 INFO  L93              Difference]: Finished difference Result 16127 states and 17203 transitions.
[2025-03-08 02:04:55,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:55,452 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 446
[2025-03-08 02:04:55,453 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:55,470 INFO  L225             Difference]: With dead ends: 16127
[2025-03-08 02:04:55,470 INFO  L226             Difference]: Without dead ends: 8229
[2025-03-08 02:04:55,475 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 02:04:55,476 INFO  L435           NwaCegarLoop]: 393 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:55,476 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 399 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:04:55,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8229 states.
[2025-03-08 02:04:55,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229.
[2025-03-08 02:04:55,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8229 states, 8228 states have (on average 1.0544482255712202) internal successors, (8676), 8228 states have internal predecessors, (8676), 0 states have call successors, (0), 0 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 02:04:55,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8676 transitions.
[2025-03-08 02:04:55,554 INFO  L78                 Accepts]: Start accepts. Automaton has 8229 states and 8676 transitions. Word has length 446
[2025-03-08 02:04:55,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:55,555 INFO  L471      AbstractCegarLoop]: Abstraction has 8229 states and 8676 transitions.
[2025-03-08 02:04:55,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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 02:04:55,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 8229 states and 8676 transitions.
[2025-03-08 02:04:55,562 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 549
[2025-03-08 02:04:55,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:55,563 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:55,563 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 02:04:55,563 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:55,564 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:55,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -1493749944, now seen corresponding path program 1 times
[2025-03-08 02:04:55,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:55,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738024762]
[2025-03-08 02:04:55,564 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:55,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:55,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes.
[2025-03-08 02:04:55,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements.
[2025-03-08 02:04:55,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:55,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:55,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 492 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-03-08 02:04:55,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:55,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738024762]
[2025-03-08 02:04:55,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738024762] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:55,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:55,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:55,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411727814]
[2025-03-08 02:04:55,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:55,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:55,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:55,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:55,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:55,811 INFO  L87              Difference]: Start difference. First operand 8229 states and 8676 transitions. Second operand  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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 02:04:56,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:56,482 INFO  L93              Difference]: Finished difference Result 18759 states and 19787 transitions.
[2025-03-08 02:04:56,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:56,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 548
[2025-03-08 02:04:56,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:56,498 INFO  L225             Difference]: With dead ends: 18759
[2025-03-08 02:04:56,498 INFO  L226             Difference]: Without dead ends: 10861
[2025-03-08 02:04:56,505 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 02:04:56,505 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:56,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 36 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:04:56,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10861 states.
[2025-03-08 02:04:56,599 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861.
[2025-03-08 02:04:56,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10861 states, 10860 states have (on average 1.0482504604051566) internal successors, (11384), 10860 states have internal predecessors, (11384), 0 states have call successors, (0), 0 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 02:04:56,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11384 transitions.
[2025-03-08 02:04:56,622 INFO  L78                 Accepts]: Start accepts. Automaton has 10861 states and 11384 transitions. Word has length 548
[2025-03-08 02:04:56,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:56,622 INFO  L471      AbstractCegarLoop]: Abstraction has 10861 states and 11384 transitions.
[2025-03-08 02:04:56,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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 02:04:56,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 10861 states and 11384 transitions.
[2025-03-08 02:04:56,627 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 603
[2025-03-08 02:04:56,627 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:56,627 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:56,627 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 02:04:56,628 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:56,628 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:56,628 INFO  L85        PathProgramCache]: Analyzing trace with hash 2051604431, now seen corresponding path program 1 times
[2025-03-08 02:04:56,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:56,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072813540]
[2025-03-08 02:04:56,628 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:56,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:56,662 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-03-08 02:04:56,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-03-08 02:04:56,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:56,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:57,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 616 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-03-08 02:04:57,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:57,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072813540]
[2025-03-08 02:04:57,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072813540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:57,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:57,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:57,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50681962]
[2025-03-08 02:04:57,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:57,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:04:57,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:57,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:04:57,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:04:57,195 INFO  L87              Difference]: Start difference. First operand 10861 states and 11384 transitions. Second operand  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 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 02:04:58,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:58,055 INFO  L93              Difference]: Finished difference Result 21720 states and 22772 transitions.
[2025-03-08 02:04:58,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:04:58,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 602
[2025-03-08 02:04:58,056 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:58,071 INFO  L225             Difference]: With dead ends: 21720
[2025-03-08 02:04:58,071 INFO  L226             Difference]: Without dead ends: 11190
[2025-03-08 02:04:58,079 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 02:04:58,079 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 268 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:58,080 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 113 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:04:58,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11190 states.
[2025-03-08 02:04:58,151 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190.
[2025-03-08 02:04:58,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11190 states, 11189 states have (on average 1.0470104566985432) internal successors, (11715), 11189 states have internal predecessors, (11715), 0 states have call successors, (0), 0 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 02:04:58,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11715 transitions.
[2025-03-08 02:04:58,171 INFO  L78                 Accepts]: Start accepts. Automaton has 11190 states and 11715 transitions. Word has length 602
[2025-03-08 02:04:58,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:58,171 INFO  L471      AbstractCegarLoop]: Abstraction has 11190 states and 11715 transitions.
[2025-03-08 02:04:58,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 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 02:04:58,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 11190 states and 11715 transitions.
[2025-03-08 02:04:58,176 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 664
[2025-03-08 02:04:58,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:58,176 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 02:04:58,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 02:04:58,177 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:58,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:58,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -2117120580, now seen corresponding path program 1 times
[2025-03-08 02:04:58,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:58,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508809599]
[2025-03-08 02:04:58,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:58,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:58,214 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes.
[2025-03-08 02:04:58,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements.
[2025-03-08 02:04:58,238 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:58,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:58,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked.
[2025-03-08 02:04:58,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:58,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508809599]
[2025-03-08 02:04:58,461 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508809599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:58,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:58,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:58,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167042566]
[2025-03-08 02:04:58,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:58,461 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:58,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:58,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:58,462 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:58,462 INFO  L87              Difference]: Start difference. First operand 11190 states and 11715 transitions. Second operand  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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 02:04:58,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:04:58,998 INFO  L93              Difference]: Finished difference Result 21720 states and 22766 transitions.
[2025-03-08 02:04:58,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:04:58,999 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 663
[2025-03-08 02:04:58,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:04:59,013 INFO  L225             Difference]: With dead ends: 21720
[2025-03-08 02:04:59,014 INFO  L226             Difference]: Without dead ends: 11190
[2025-03-08 02:04:59,021 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 02:04:59,022 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 297 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:04:59,022 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 419 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:04:59,028 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11190 states.
[2025-03-08 02:04:59,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190.
[2025-03-08 02:04:59,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11190 states, 11189 states have (on average 1.0437930109929394) internal successors, (11679), 11189 states have internal predecessors, (11679), 0 states have call successors, (0), 0 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 02:04:59,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11679 transitions.
[2025-03-08 02:04:59,103 INFO  L78                 Accepts]: Start accepts. Automaton has 11190 states and 11679 transitions. Word has length 663
[2025-03-08 02:04:59,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:04:59,104 INFO  L471      AbstractCegarLoop]: Abstraction has 11190 states and 11679 transitions.
[2025-03-08 02:04:59,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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 02:04:59,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 11190 states and 11679 transitions.
[2025-03-08 02:04:59,137 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1092
[2025-03-08 02:04:59,137 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:04:59,137 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:04:59,138 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 02:04:59,139 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:04:59,139 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:04:59,140 INFO  L85        PathProgramCache]: Analyzing trace with hash -772233039, now seen corresponding path program 1 times
[2025-03-08 02:04:59,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:04:59,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312036324]
[2025-03-08 02:04:59,140 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:04:59,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:04:59,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1091 statements into 1 equivalence classes.
[2025-03-08 02:04:59,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1091 of 1091 statements.
[2025-03-08 02:04:59,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:04:59,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:04:59,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 2103 backedges. 1528 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked.
[2025-03-08 02:04:59,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:04:59,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312036324]
[2025-03-08 02:04:59,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312036324] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:04:59,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:04:59,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:04:59,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639965725]
[2025-03-08 02:04:59,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:04:59,694 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:04:59,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:04:59,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:04:59,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:04:59,694 INFO  L87              Difference]: Start difference. First operand 11190 states and 11679 transitions. Second operand  has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 02:05:00,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:00,227 INFO  L93              Difference]: Finished difference Result 24023 states and 25083 transitions.
[2025-03-08 02:05:00,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:05:00,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1091
[2025-03-08 02:05:00,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:00,242 INFO  L225             Difference]: With dead ends: 24023
[2025-03-08 02:05:00,242 INFO  L226             Difference]: Without dead ends: 13493
[2025-03-08 02:05:00,252 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 02:05:00,253 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:00,254 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:05:00,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13493 states.
[2025-03-08 02:05:00,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13164.
[2025-03-08 02:05:00,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13164 states, 13163 states have (on average 1.037453468054395) internal successors, (13656), 13163 states have internal predecessors, (13656), 0 states have call successors, (0), 0 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 02:05:00,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13656 transitions.
[2025-03-08 02:05:00,352 INFO  L78                 Accepts]: Start accepts. Automaton has 13164 states and 13656 transitions. Word has length 1091
[2025-03-08 02:05:00,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:00,353 INFO  L471      AbstractCegarLoop]: Abstraction has 13164 states and 13656 transitions.
[2025-03-08 02:05:00,353 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 02:05:00,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 13164 states and 13656 transitions.
[2025-03-08 02:05:00,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1093
[2025-03-08 02:05:00,365 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:00,366 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:00,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 02:05:00,366 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:00,366 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:00,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801887461, now seen corresponding path program 1 times
[2025-03-08 02:05:00,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:00,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149756473]
[2025-03-08 02:05:00,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:00,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:00,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1092 statements into 1 equivalence classes.
[2025-03-08 02:05:00,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1092 of 1092 statements.
[2025-03-08 02:05:00,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:00,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:01,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 2108 backedges. 1400 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked.
[2025-03-08 02:05:01,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:01,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149756473]
[2025-03-08 02:05:01,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149756473] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:01,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:05:01,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 02:05:01,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039437444]
[2025-03-08 02:05:01,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:01,257 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 02:05:01,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:01,257 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 02:05:01,257 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:05:01,258 INFO  L87              Difference]: Start difference. First operand 13164 states and 13656 transitions. Second operand  has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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 02:05:02,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:02,124 INFO  L93              Difference]: Finished difference Result 25669 states and 26649 transitions.
[2025-03-08 02:05:02,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 02:05:02,125 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 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 1092
[2025-03-08 02:05:02,125 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:02,182 INFO  L225             Difference]: With dead ends: 25669
[2025-03-08 02:05:02,182 INFO  L226             Difference]: Without dead ends: 13165
[2025-03-08 02:05:02,187 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 02:05:02,188 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 505 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:02,188 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 562 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:05:02,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13165 states.
[2025-03-08 02:05:02,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13165 to 13164.
[2025-03-08 02:05:02,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13164 states, 13163 states have (on average 1.0371495859606472) internal successors, (13652), 13163 states have internal predecessors, (13652), 0 states have call successors, (0), 0 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 02:05:02,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13652 transitions.
[2025-03-08 02:05:02,322 INFO  L78                 Accepts]: Start accepts. Automaton has 13164 states and 13652 transitions. Word has length 1092
[2025-03-08 02:05:02,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:02,323 INFO  L471      AbstractCegarLoop]: Abstraction has 13164 states and 13652 transitions.
[2025-03-08 02:05:02,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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 02:05:02,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 13164 states and 13652 transitions.
[2025-03-08 02:05:02,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1107
[2025-03-08 02:05:02,343 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:02,344 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:02,344 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 02:05:02,344 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:02,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:02,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -1779007012, now seen corresponding path program 1 times
[2025-03-08 02:05:02,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:02,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385904138]
[2025-03-08 02:05:02,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:02,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:02,441 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1106 statements into 1 equivalence classes.
[2025-03-08 02:05:02,497 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1106 of 1106 statements.
[2025-03-08 02:05:02,498 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:02,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:03,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 1971 backedges. 1300 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked.
[2025-03-08 02:05:03,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:03,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385904138]
[2025-03-08 02:05:03,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385904138] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:03,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:05:03,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 02:05:03,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910454322]
[2025-03-08 02:05:03,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:03,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:05:03,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:03,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:05:03,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:05:03,377 INFO  L87              Difference]: Start difference. First operand 13164 states and 13652 transitions. Second operand  has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 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 02:05:04,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:04,129 INFO  L93              Difference]: Finished difference Result 25677 states and 26649 transitions.
[2025-03-08 02:05:04,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 02:05:04,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 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 1106
[2025-03-08 02:05:04,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:04,142 INFO  L225             Difference]: With dead ends: 25677
[2025-03-08 02:05:04,142 INFO  L226             Difference]: Without dead ends: 13173
[2025-03-08 02:05:04,149 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 02:05:04,149 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:04,150 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 02:05:04,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13173 states.
[2025-03-08 02:05:04,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 13164.
[2025-03-08 02:05:04,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13164 states, 13163 states have (on average 1.0369976449137734) internal successors, (13650), 13163 states have internal predecessors, (13650), 0 states have call successors, (0), 0 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 02:05:04,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13650 transitions.
[2025-03-08 02:05:04,244 INFO  L78                 Accepts]: Start accepts. Automaton has 13164 states and 13650 transitions. Word has length 1106
[2025-03-08 02:05:04,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:04,245 INFO  L471      AbstractCegarLoop]: Abstraction has 13164 states and 13650 transitions.
[2025-03-08 02:05:04,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 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 02:05:04,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 13164 states and 13650 transitions.
[2025-03-08 02:05:04,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1122
[2025-03-08 02:05:04,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:04,258 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:04,258 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 02:05:04,258 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:04,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:04,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -745331755, now seen corresponding path program 1 times
[2025-03-08 02:05:04,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:04,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92468271]
[2025-03-08 02:05:04,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:04,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:04,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1121 statements into 1 equivalence classes.
[2025-03-08 02:05:04,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1121 of 1121 statements.
[2025-03-08 02:05:04,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:04,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:04,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 2195 backedges. 1618 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked.
[2025-03-08 02:05:04,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:04,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92468271]
[2025-03-08 02:05:04,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92468271] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:04,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:05:04,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:05:04,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961923240]
[2025-03-08 02:05:04,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:04,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:05:04,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:04,727 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:05:04,727 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:05:04,728 INFO  L87              Difference]: Start difference. First operand 13164 states and 13650 transitions. Second operand  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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 02:05:05,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:05,254 INFO  L93              Difference]: Finished difference Result 25668 states and 26636 transitions.
[2025-03-08 02:05:05,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:05:05,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 1121
[2025-03-08 02:05:05,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:05,264 INFO  L225             Difference]: With dead ends: 25668
[2025-03-08 02:05:05,264 INFO  L226             Difference]: Without dead ends: 13164
[2025-03-08 02:05:05,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 02:05:05,272 INFO  L435           NwaCegarLoop]: 418 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:05,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 424 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:05:05,278 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13164 states.
[2025-03-08 02:05:05,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835.
[2025-03-08 02:05:05,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12835 states, 12834 states have (on average 1.034206015271934) internal successors, (13273), 12834 states have internal predecessors, (13273), 0 states have call successors, (0), 0 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 02:05:05,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13273 transitions.
[2025-03-08 02:05:05,365 INFO  L78                 Accepts]: Start accepts. Automaton has 12835 states and 13273 transitions. Word has length 1121
[2025-03-08 02:05:05,366 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:05,366 INFO  L471      AbstractCegarLoop]: Abstraction has 12835 states and 13273 transitions.
[2025-03-08 02:05:05,366 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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 02:05:05,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 12835 states and 13273 transitions.
[2025-03-08 02:05:05,378 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1239
[2025-03-08 02:05:05,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:05,379 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:05,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 02:05:05,379 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:05,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:05,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 1460082672, now seen corresponding path program 1 times
[2025-03-08 02:05:05,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:05,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717817118]
[2025-03-08 02:05:05,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:05,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:05,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1238 statements into 1 equivalence classes.
[2025-03-08 02:05:05,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1238 of 1238 statements.
[2025-03-08 02:05:05,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:05,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:06,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 2516 backedges. 993 proven. 944 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked.
[2025-03-08 02:05:06,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:06,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717817118]
[2025-03-08 02:05:06,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717817118] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:05:06,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51582398]
[2025-03-08 02:05:06,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:06,575 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:05:06,576 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:05:06,578 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 02:05:06,579 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 02:05:06,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1238 statements into 1 equivalence classes.
[2025-03-08 02:05:06,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1238 of 1238 statements.
[2025-03-08 02:05:06,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:06,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:06,798 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:05:06,809 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:05:07,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 2516 backedges. 1389 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked.
[2025-03-08 02:05:07,182 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:05:07,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [51582398] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:07,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:05:07,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-08 02:05:07,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957689665]
[2025-03-08 02:05:07,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:07,183 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:05:07,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:07,184 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:05:07,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:05:07,184 INFO  L87              Difference]: Start difference. First operand 12835 states and 13273 transitions. Second operand  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 02:05:07,747 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:07,747 INFO  L93              Difference]: Finished difference Result 25010 states and 25882 transitions.
[2025-03-08 02:05:07,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:05:07,748 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1238
[2025-03-08 02:05:07,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:07,758 INFO  L225             Difference]: With dead ends: 25010
[2025-03-08 02:05:07,758 INFO  L226             Difference]: Without dead ends: 12835
[2025-03-08 02:05:07,765 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1242 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:05:07,769 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:07,769 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:05:07,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12835 states.
[2025-03-08 02:05:07,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506.
[2025-03-08 02:05:07,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12506 states, 12505 states have (on average 1.0279088364654139) internal successors, (12854), 12505 states have internal predecessors, (12854), 0 states have call successors, (0), 0 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 02:05:07,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12854 transitions.
[2025-03-08 02:05:07,903 INFO  L78                 Accepts]: Start accepts. Automaton has 12506 states and 12854 transitions. Word has length 1238
[2025-03-08 02:05:07,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:07,904 INFO  L471      AbstractCegarLoop]: Abstraction has 12506 states and 12854 transitions.
[2025-03-08 02:05:07,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 02:05:07,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 12506 states and 12854 transitions.
[2025-03-08 02:05:07,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1347
[2025-03-08 02:05:07,918 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:07,919 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:07,926 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 02:05:08,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-08 02:05:08,120 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:08,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:08,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 430023326, now seen corresponding path program 1 times
[2025-03-08 02:05:08,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:08,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626192713]
[2025-03-08 02:05:08,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:08,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:08,183 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1346 statements into 1 equivalence classes.
[2025-03-08 02:05:08,222 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1346 of 1346 statements.
[2025-03-08 02:05:08,222 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:08,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:09,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 3584 backedges. 856 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked.
[2025-03-08 02:05:09,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:09,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626192713]
[2025-03-08 02:05:09,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626192713] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:09,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:05:09,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:05:09,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17194544]
[2025-03-08 02:05:09,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:09,068 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:05:09,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:09,069 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:05:09,069 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:05:09,069 INFO  L87              Difference]: Start difference. First operand 12506 states and 12854 transitions. Second operand  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 02:05:09,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:09,596 INFO  L93              Difference]: Finished difference Result 24352 states and 25044 transitions.
[2025-03-08 02:05:09,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:05:09,596 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 1346
[2025-03-08 02:05:09,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:09,605 INFO  L225             Difference]: With dead ends: 24352
[2025-03-08 02:05:09,605 INFO  L226             Difference]: Without dead ends: 12506
[2025-03-08 02:05:09,612 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 02:05:09,612 INFO  L435           NwaCegarLoop]: 367 mSDtfsCounter, 272 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:09,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 372 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:05:09,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12506 states.
[2025-03-08 02:05:09,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506.
[2025-03-08 02:05:09,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12506 states, 12505 states have (on average 1.0241503398640543) internal successors, (12807), 12505 states have internal predecessors, (12807), 0 states have call successors, (0), 0 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 02:05:09,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12807 transitions.
[2025-03-08 02:05:09,696 INFO  L78                 Accepts]: Start accepts. Automaton has 12506 states and 12807 transitions. Word has length 1346
[2025-03-08 02:05:09,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:09,697 INFO  L471      AbstractCegarLoop]: Abstraction has 12506 states and 12807 transitions.
[2025-03-08 02:05:09,697 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 02:05:09,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 12506 states and 12807 transitions.
[2025-03-08 02:05:09,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1445
[2025-03-08 02:05:09,711 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:05:09,711 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:09,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 02:05:09,711 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:05:09,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:05:09,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676370743, now seen corresponding path program 1 times
[2025-03-08 02:05:09,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:05:09,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203982810]
[2025-03-08 02:05:09,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:05:09,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:05:09,775 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1444 statements into 1 equivalence classes.
[2025-03-08 02:05:09,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1444 of 1444 statements.
[2025-03-08 02:05:09,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:05:09,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:05:10,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 4057 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked.
[2025-03-08 02:05:10,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:05:10,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203982810]
[2025-03-08 02:05:10,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203982810] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:05:10,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:05:10,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:05:10,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299894121]
[2025-03-08 02:05:10,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:05:10,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:05:10,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:05:10,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:05:10,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:05:10,407 INFO  L87              Difference]: Start difference. First operand 12506 states and 12807 transitions. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 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 02:05:10,963 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:05:10,963 INFO  L93              Difference]: Finished difference Result 25337 states and 25950 transitions.
[2025-03-08 02:05:10,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:05:10,963 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 1444
[2025-03-08 02:05:10,964 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:05:10,964 INFO  L225             Difference]: With dead ends: 25337
[2025-03-08 02:05:10,964 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 02:05:10,973 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 02:05:10,973 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 168 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:05:10,973 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 418 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:05:10,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 02:05:10,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 02:05:10,974 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 02:05:10,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 02:05:10,974 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1444
[2025-03-08 02:05:10,974 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:05:10,974 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 02:05:10,974 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 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 02:05:10,974 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 02:05:10,974 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 02:05:10,976 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 02:05:10,977 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 02:05:10,979 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:05:10,980 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 02:05:11,458 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 02:05:11,477 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:05:11 BoogieIcfgContainer
[2025-03-08 02:05:11,477 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 02:05:11,477 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 02:05:11,478 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 02:05:11,478 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 02:05:11,478 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:44" (3/4) ...
[2025-03-08 02:05:11,480 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 02:05:11,505 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-03-08 02:05:11,506 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 02:05:11,508 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 02:05:11,509 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 02:05:11,644 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 02:05:11,644 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 02:05:11,644 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 02:05:11,645 INFO  L158              Benchmark]: Toolchain (without parser) took 29911.91ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 118.5MB in the beginning and 878.6MB in the end (delta: -760.1MB). Peak memory consumption was 535.4MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,645 INFO  L158              Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 02:05:11,646 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 594.42ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 59.5MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,646 INFO  L158              Benchmark]: Boogie Procedure Inliner took 109.64ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 36.6MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,646 INFO  L158              Benchmark]: Boogie Preprocessor took 163.61ms. Allocated memory is still 167.8MB. Free memory was 36.6MB in the beginning and 78.2MB in the end (delta: -41.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,646 INFO  L158              Benchmark]: IcfgBuilder took 1662.08ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 78.2MB in the beginning and 225.0MB in the end (delta: -146.8MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,647 INFO  L158              Benchmark]: TraceAbstraction took 27210.20ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 223.7MB in the beginning and 903.5MB in the end (delta: -679.8MB). Peak memory consumption was 422.2MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,648 INFO  L158              Benchmark]: Witness Printer took 167.03ms. Allocated memory is still 1.5GB. Free memory was 903.5MB in the beginning and 878.6MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 02:05:11,649 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.45ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 594.42ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 59.5MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 109.64ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 36.6MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 163.61ms. Allocated memory is still 167.8MB. Free memory was 36.6MB in the beginning and 78.2MB in the end (delta: -41.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1662.08ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 78.2MB in the beginning and 225.0MB in the end (delta: -146.8MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 27210.20ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 223.7MB in the beginning and 903.5MB in the end (delta: -679.8MB). Peak memory consumption was 422.2MB. Max. memory is 16.1GB.
 * Witness Printer took 167.03ms. Allocated memory is still 1.5GB. Free memory was 903.5MB in the beginning and 878.6MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. 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: 167]: 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, 396 locations, 722 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 18, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5445 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5445 mSDsluCounter, 5172 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 2552 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16550 IncrementalHoareTripleChecker+Invalid, 19102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2552 mSolverCounterUnsat, 4932 mSDtfsCounter, 16550 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1586 GetRequests, 1554 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13164occurred in iteration=12, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 2313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 13747 NumberOfCodeBlocks, 13747 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 13727 ConstructedInterpolants, 0 QuantifiedInterpolants, 30488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1775 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 22913/23878 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: 1783]: Location Invariant
    Derived location invariant: ((((((((((((((((((((a12 == 9) && (a15 <= 3)) && (a16 == 12)) || (((a15 <= 3) && (a16 == 12)) && (a12 <= 6))) || ((a16 <= 8) && (a12 == 9))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || (((a16 != 10) && (a16 <= 11)) && (7 == a12))) || ((((((long long) a18 + 79) <= 0) && (a12 == 9)) && (a16 != 10)) && (a16 <= 11))) || (((a12 <= 5) && (a15 <= 3)) && (a16 <= 11))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || (((a15 <= 3) && (a12 == 8)) && (a16 <= 11))) || ((((((long long) a18 + 79) <= 0) && (a15 <= 3)) && (a12 <= 6)) && (a16 <= 11))) || (((((long long) a18 + 79) <= 0) && (a12 <= 5)) && (a16 <= 11))) || (((a16 != 10) && (a12 == 8)) && (a16 <= 11))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || ((a16 <= 8) && (a15 <= 3))) || ((a16 == 10) && (a12 <= 6))) || ((((5 != a12) && (a12 <= 6)) && (a16 <= 11)) && (4 <= a15)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 02:05:11,664 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