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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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/Problem18_label41.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 c46880ee7396e67063fc71dfe693983c82e91caf4fc722eef8750e6aef0cc86c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 15:25:36,061 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 15:25:36,115 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 15:25:36,120 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 15:25:36,120 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 15:25:36,143 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 15:25:36,144 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 15:25:36,144 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 15:25:36,144 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 15:25:36,144 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 15:25:36,144 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 15:25:36,144 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 15:25:36,144 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 15:25:36,145 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 15:25:36,146 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 15:25:36,146 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 15:25:36,147 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:25:36,147 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 15:25:36,147 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 15:25:36,147 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 -> c46880ee7396e67063fc71dfe693983c82e91caf4fc722eef8750e6aef0cc86c
[2025-03-16 15:25:36,346 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 15:25:36,354 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 15:25:36,355 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 15:25:36,356 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 15:25:36,357 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 15:25:36,357 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label41.c
[2025-03-16 15:25:37,496 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb434253/52b3e8db6fcf43e39d4b5b72de864a80/FLAGbf575a655
[2025-03-16 15:25:37,852 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 15:25:37,853 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label41.c
[2025-03-16 15:25:37,879 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb434253/52b3e8db6fcf43e39d4b5b72de864a80/FLAGbf575a655
[2025-03-16 15:25:37,894 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb434253/52b3e8db6fcf43e39d4b5b72de864a80
[2025-03-16 15:25:37,895 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 15:25:37,897 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 15:25:37,898 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 15:25:37,899 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 15:25:37,902 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 15:25:37,902 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:37" (1/1) ...
[2025-03-16 15:25:37,903 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:37, skipping insertion in model container
[2025-03-16 15:25:37,904 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:37" (1/1) ...
[2025-03-16 15:25:37,957 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 15:25:38,100 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/Problem18_label41.c[6755,6768]
[2025-03-16 15:25:38,413 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:25:38,421 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 15:25:38,455 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/Problem18_label41.c[6755,6768]
[2025-03-16 15:25:38,602 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 15:25:38,617 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 15:25:38,618 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38 WrapperNode
[2025-03-16 15:25:38,618 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 15:25:38,619 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 15:25:38,619 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 15:25:38,619 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 15:25:38,623 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,658 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,795 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-16 15:25:38,795 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 15:25:38,796 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 15:25:38,796 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 15:25:38,796 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 15:25:38,802 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,802 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,829 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,915 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-16 15:25:38,915 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,915 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,964 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,974 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,986 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:38,997 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:39,018 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 15:25:39,019 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 15:25:39,019 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 15:25:39,019 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 15:25:39,020 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (1/1) ...
[2025-03-16 15:25:39,025 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 15:25:39,034 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:25:39,045 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-16 15:25:39,048 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-16 15:25:39,064 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 15:25:39,065 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 15:25:39,065 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 15:25:39,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 15:25:39,139 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 15:25:39,140 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 15:25:41,736 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-16 15:25:41,737 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-16 15:25:41,860 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-16 15:25:41,860 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 15:25:41,888 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 15:25:41,892 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 15:25:41,892 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:41 BoogieIcfgContainer
[2025-03-16 15:25:41,892 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 15:25:41,894 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 15:25:41,894 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 15:25:41,897 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 15:25:41,897 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:25:37" (1/3) ...
[2025-03-16 15:25:41,898 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e9e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:41, skipping insertion in model container
[2025-03-16 15:25:41,899 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:38" (2/3) ...
[2025-03-16 15:25:41,900 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e9e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:41, skipping insertion in model container
[2025-03-16 15:25:41,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:41" (3/3) ...
[2025-03-16 15:25:41,901 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label41.c
[2025-03-16 15:25:41,910 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 15:25:41,912 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label41.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 15:25:41,970 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 15:25:41,980 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;@619ee73c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 15:25:41,980 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 15:25:41,986 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 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-16 15:25:41,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-03-16 15:25:41,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:41,992 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:25:41,993 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:41,996 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:41,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 241568183, now seen corresponding path program 1 times
[2025-03-16 15:25:42,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:42,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770834346]
[2025-03-16 15:25:42,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:42,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:42,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-03-16 15:25:42,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-03-16 15:25:42,071 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:42,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:42,119 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-16 15:25:42,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:42,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770834346]
[2025-03-16 15:25:42,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770834346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:42,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:42,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:42,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506880230]
[2025-03-16 15:25:42,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:42,124 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 15:25:42,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:42,139 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 15:25:42,139 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:25:42,142 INFO  L87              Difference]: Start difference. First operand  has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-16 15:25:42,202 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:42,203 INFO  L93              Difference]: Finished difference Result 1391 states and 2763 transitions.
[2025-03-16 15:25:42,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 15:25:42,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64
[2025-03-16 15:25:42,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:42,212 INFO  L225             Difference]: With dead ends: 1391
[2025-03-16 15:25:42,213 INFO  L226             Difference]: Without dead ends: 693
[2025-03-16 15:25:42,216 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 15:25:42,218 INFO  L435           NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:42,218 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 15:25:42,231 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 693 states.
[2025-03-16 15:25:42,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693.
[2025-03-16 15:25:42,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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-16 15:25:42,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions.
[2025-03-16 15:25:42,273 INFO  L78                 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 64
[2025-03-16 15:25:42,273 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:42,273 INFO  L471      AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions.
[2025-03-16 15:25:42,273 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-16 15:25:42,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions.
[2025-03-16 15:25:42,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-03-16 15:25:42,274 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:42,274 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:25:42,274 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 15:25:42,274 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:42,274 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:42,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139026241, now seen corresponding path program 1 times
[2025-03-16 15:25:42,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:42,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734920500]
[2025-03-16 15:25:42,275 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:42,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:42,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-03-16 15:25:42,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-03-16 15:25:42,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:42,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:42,466 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-16 15:25:42,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:42,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734920500]
[2025-03-16 15:25:42,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734920500] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:42,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:42,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:42,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529242220]
[2025-03-16 15:25:42,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:42,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:42,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:42,468 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:42,468 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:25:42,468 INFO  L87              Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-16 15:25:44,747 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:44,747 INFO  L93              Difference]: Finished difference Result 2075 states and 3948 transitions.
[2025-03-16 15:25:44,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:25:44,748 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64
[2025-03-16 15:25:44,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:44,753 INFO  L225             Difference]: With dead ends: 2075
[2025-03-16 15:25:44,754 INFO  L226             Difference]: Without dead ends: 1383
[2025-03-16 15:25:44,755 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-16 15:25:44,755 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 655 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:44,755 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 249 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-16 15:25:44,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1383 states.
[2025-03-16 15:25:44,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383.
[2025-03-16 15:25:44,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1383 states, 1382 states have (on average 1.7344428364688858) internal successors, (2397), 1382 states have internal predecessors, (2397), 0 states have call successors, (0), 0 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-16 15:25:44,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2397 transitions.
[2025-03-16 15:25:44,798 INFO  L78                 Accepts]: Start accepts. Automaton has 1383 states and 2397 transitions. Word has length 64
[2025-03-16 15:25:44,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:44,798 INFO  L471      AbstractCegarLoop]: Abstraction has 1383 states and 2397 transitions.
[2025-03-16 15:25:44,799 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-16 15:25:44,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 1383 states and 2397 transitions.
[2025-03-16 15:25:44,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 15:25:44,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:44,800 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:25:44,801 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 15:25:44,801 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:44,801 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:44,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 1436330680, now seen corresponding path program 1 times
[2025-03-16 15:25:44,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:44,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11825187]
[2025-03-16 15:25:44,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:44,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:44,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 15:25:44,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 15:25:44,854 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:44,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:44,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:25:44,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:44,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11825187]
[2025-03-16 15:25:44,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11825187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:44,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:44,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:44,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776185252]
[2025-03-16 15:25:44,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:44,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:44,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:44,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:44,991 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:25:44,991 INFO  L87              Difference]: Start difference. First operand 1383 states and 2397 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-16 15:25:47,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:47,085 INFO  L93              Difference]: Finished difference Result 4145 states and 7188 transitions.
[2025-03-16 15:25:47,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:25:47,086 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 15:25:47,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:47,095 INFO  L225             Difference]: With dead ends: 4145
[2025-03-16 15:25:47,098 INFO  L226             Difference]: Without dead ends: 2763
[2025-03-16 15:25:47,099 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-16 15:25:47,100 INFO  L435           NwaCegarLoop]: 567 mSDtfsCounter, 676 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:47,100 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 572 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-16 15:25:47,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2763 states.
[2025-03-16 15:25:47,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763.
[2025-03-16 15:25:47,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2763 states, 2762 states have (on average 1.4308472121650977) internal successors, (3952), 2762 states have internal predecessors, (3952), 0 states have call successors, (0), 0 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-16 15:25:47,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3952 transitions.
[2025-03-16 15:25:47,144 INFO  L78                 Accepts]: Start accepts. Automaton has 2763 states and 3952 transitions. Word has length 133
[2025-03-16 15:25:47,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:47,144 INFO  L471      AbstractCegarLoop]: Abstraction has 2763 states and 3952 transitions.
[2025-03-16 15:25:47,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-16 15:25:47,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 2763 states and 3952 transitions.
[2025-03-16 15:25:47,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-16 15:25:47,146 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:47,146 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:25:47,147 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 15:25:47,147 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:47,147 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:47,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649249056, now seen corresponding path program 1 times
[2025-03-16 15:25:47,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:47,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350984000]
[2025-03-16 15:25:47,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:47,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:47,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-16 15:25:47,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-16 15:25:47,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:47,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:47,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:25:47,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:47,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350984000]
[2025-03-16 15:25:47,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350984000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:47,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:47,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:47,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934704530]
[2025-03-16 15:25:47,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:47,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:47,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:47,320 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:47,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:25:47,321 INFO  L87              Difference]: Start difference. First operand 2763 states and 3952 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-16 15:25:49,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:49,269 INFO  L93              Difference]: Finished difference Result 8287 states and 11854 transitions.
[2025-03-16 15:25:49,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:25:49,272 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149
[2025-03-16 15:25:49,272 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:49,285 INFO  L225             Difference]: With dead ends: 8287
[2025-03-16 15:25:49,285 INFO  L226             Difference]: Without dead ends: 5525
[2025-03-16 15:25:49,287 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-16 15:25:49,288 INFO  L435           NwaCegarLoop]: 427 mSDtfsCounter, 691 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:49,288 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 433 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-16 15:25:49,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5525 states.
[2025-03-16 15:25:49,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5523.
[2025-03-16 15:25:49,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5523 states, 5522 states have (on average 1.282144150670047) internal successors, (7080), 5522 states have internal predecessors, (7080), 0 states have call successors, (0), 0 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-16 15:25:49,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7080 transitions.
[2025-03-16 15:25:49,353 INFO  L78                 Accepts]: Start accepts. Automaton has 5523 states and 7080 transitions. Word has length 149
[2025-03-16 15:25:49,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:49,353 INFO  L471      AbstractCegarLoop]: Abstraction has 5523 states and 7080 transitions.
[2025-03-16 15:25:49,353 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-16 15:25:49,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 5523 states and 7080 transitions.
[2025-03-16 15:25:49,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2025-03-16 15:25:49,356 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:49,356 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:25:49,356 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 15:25:49,356 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:49,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:49,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 686869613, now seen corresponding path program 1 times
[2025-03-16 15:25:49,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:49,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607087315]
[2025-03-16 15:25:49,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:49,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:49,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-03-16 15:25:49,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-03-16 15:25:49,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:49,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:49,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:25:49,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:49,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607087315]
[2025-03-16 15:25:49,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607087315] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:49,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:49,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:25:49,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063295424]
[2025-03-16 15:25:49,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:49,728 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:25:49,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:49,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:25:49,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:25:49,729 INFO  L87              Difference]: Start difference. First operand 5523 states and 7080 transitions. Second operand  has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-16 15:25:52,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:52,363 INFO  L93              Difference]: Finished difference Result 15187 states and 18711 transitions.
[2025-03-16 15:25:52,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:25:52,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182
[2025-03-16 15:25:52,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:52,382 INFO  L225             Difference]: With dead ends: 15187
[2025-03-16 15:25:52,383 INFO  L226             Difference]: Without dead ends: 9665
[2025-03-16 15:25:52,386 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-16 15:25:52,387 INFO  L435           NwaCegarLoop]: 630 mSDtfsCounter, 1874 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:52,387 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 648 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-16 15:25:52,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9665 states.
[2025-03-16 15:25:52,477 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9665 to 8973.
[2025-03-16 15:25:52,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8973 states, 8972 states have (on average 1.2006241640659832) internal successors, (10772), 8972 states have internal predecessors, (10772), 0 states have call successors, (0), 0 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-16 15:25:52,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8973 states to 8973 states and 10772 transitions.
[2025-03-16 15:25:52,503 INFO  L78                 Accepts]: Start accepts. Automaton has 8973 states and 10772 transitions. Word has length 182
[2025-03-16 15:25:52,504 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:52,504 INFO  L471      AbstractCegarLoop]: Abstraction has 8973 states and 10772 transitions.
[2025-03-16 15:25:52,504 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-16 15:25:52,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 8973 states and 10772 transitions.
[2025-03-16 15:25:52,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2025-03-16 15:25:52,507 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:52,508 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-16 15:25:52,508 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 15:25:52,508 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:52,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:52,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002034747, now seen corresponding path program 1 times
[2025-03-16 15:25:52,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:52,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955087768]
[2025-03-16 15:25:52,509 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:52,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:52,534 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.
[2025-03-16 15:25:52,553 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements.
[2025-03-16 15:25:52,554 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:52,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:52,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 242 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-16 15:25:52,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:52,938 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955087768]
[2025-03-16 15:25:52,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955087768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:52,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:52,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:25:52,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487811898]
[2025-03-16 15:25:52,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:52,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:25:52,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:52,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:25:52,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:25:52,941 INFO  L87              Difference]: Start difference. First operand 8973 states and 10772 transitions. Second operand  has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-16 15:25:54,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:54,646 INFO  L93              Difference]: Finished difference Result 20760 states and 24425 transitions.
[2025-03-16 15:25:54,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:25:54,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 364
[2025-03-16 15:25:54,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:54,672 INFO  L225             Difference]: With dead ends: 20760
[2025-03-16 15:25:54,672 INFO  L226             Difference]: Without dead ends: 11735
[2025-03-16 15:25:54,677 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-16 15:25:54,678 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 531 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:54,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 636 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-16 15:25:54,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11735 states.
[2025-03-16 15:25:54,777 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 11733.
[2025-03-16 15:25:54,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11733 states, 11732 states have (on average 1.1211217183770883) internal successors, (13153), 11732 states have internal predecessors, (13153), 0 states have call successors, (0), 0 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-16 15:25:54,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 13153 transitions.
[2025-03-16 15:25:54,855 INFO  L78                 Accepts]: Start accepts. Automaton has 11733 states and 13153 transitions. Word has length 364
[2025-03-16 15:25:54,855 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:54,855 INFO  L471      AbstractCegarLoop]: Abstraction has 11733 states and 13153 transitions.
[2025-03-16 15:25:54,862 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-16 15:25:54,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 11733 states and 13153 transitions.
[2025-03-16 15:25:54,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 879
[2025-03-16 15:25:54,879 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:54,879 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-16 15:25:54,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 15:25:54,879 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:54,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:54,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554852473, now seen corresponding path program 1 times
[2025-03-16 15:25:54,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:54,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659783647]
[2025-03-16 15:25:54,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:54,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:54,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 878 statements into 1 equivalence classes.
[2025-03-16 15:25:54,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 878 of 878 statements.
[2025-03-16 15:25:54,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:54,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:55,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked.
[2025-03-16 15:25:55,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:55,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659783647]
[2025-03-16 15:25:55,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659783647] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:25:55,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039511469]
[2025-03-16 15:25:55,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:55,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:25:55,770 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:25:55,772 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-16 15:25:55,774 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-16 15:25:55,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 878 statements into 1 equivalence classes.
[2025-03-16 15:25:55,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 878 of 878 statements.
[2025-03-16 15:25:55,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:55,966 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:55,970 INFO  L256         TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:25:55,989 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:25:56,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked.
[2025-03-16 15:25:56,815 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:25:56,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039511469] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:56,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:25:56,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-16 15:25:56,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831776633]
[2025-03-16 15:25:56,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:56,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:56,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:56,817 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:56,817 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:25:56,817 INFO  L87              Difference]: Start difference. First operand 11733 states and 13153 transitions. Second operand  has 3 states, 3 states have (on average 173.0) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-16 15:25:58,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:25:58,479 INFO  L93              Difference]: Finished difference Result 29675 states and 33818 transitions.
[2025-03-16 15:25:58,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:25:58,482 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 173.0) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 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 878
[2025-03-16 15:25:58,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:25:58,518 INFO  L225             Difference]: With dead ends: 29675
[2025-03-16 15:25:58,518 INFO  L226             Difference]: Without dead ends: 17943
[2025-03-16 15:25:58,530 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 877 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-16 15:25:58,531 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 181 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-16 15:25:58,531 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 389 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-16 15:25:58,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17943 states.
[2025-03-16 15:25:58,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17943 to 16563.
[2025-03-16 15:25:58,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16563 states, 16562 states have (on average 1.1191281246226301) internal successors, (18535), 16562 states have internal predecessors, (18535), 0 states have call successors, (0), 0 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-16 15:25:58,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16563 states to 16563 states and 18535 transitions.
[2025-03-16 15:25:58,772 INFO  L78                 Accepts]: Start accepts. Automaton has 16563 states and 18535 transitions. Word has length 878
[2025-03-16 15:25:58,773 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:25:58,773 INFO  L471      AbstractCegarLoop]: Abstraction has 16563 states and 18535 transitions.
[2025-03-16 15:25:58,774 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.0) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-16 15:25:58,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 16563 states and 18535 transitions.
[2025-03-16 15:25:58,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 964
[2025-03-16 15:25:58,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:25:58,797 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-16 15:25:58,813 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-16 15:25:58,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:25:58,998 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:25:58,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:25:58,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1974320360, now seen corresponding path program 1 times
[2025-03-16 15:25:58,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:25:58,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695029328]
[2025-03-16 15:25:58,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:25:58,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:25:59,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes.
[2025-03-16 15:25:59,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements.
[2025-03-16 15:25:59,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:25:59,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:25:59,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 655 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked.
[2025-03-16 15:25:59,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:25:59,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695029328]
[2025-03-16 15:25:59,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695029328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:25:59,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:25:59,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 15:25:59,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111515529]
[2025-03-16 15:25:59,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:25:59,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:25:59,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:25:59,691 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:25:59,691 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:25:59,691 INFO  L87              Difference]: Start difference. First operand 16563 states and 18535 transitions. Second operand  has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-16 15:26:01,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:01,184 INFO  L93              Difference]: Finished difference Result 37955 states and 42427 transitions.
[2025-03-16 15:26:01,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:01,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 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 963
[2025-03-16 15:26:01,188 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:01,213 INFO  L225             Difference]: With dead ends: 37955
[2025-03-16 15:26:01,214 INFO  L226             Difference]: Without dead ends: 21393
[2025-03-16 15:26:01,228 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-16 15:26:01,228 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:01,228 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 76 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:26:01,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21393 states.
[2025-03-16 15:26:01,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21393 to 21393.
[2025-03-16 15:26:01,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21393 states, 21392 states have (on average 1.100224382946896) internal successors, (23536), 21392 states have internal predecessors, (23536), 0 states have call successors, (0), 0 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-16 15:26:01,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21393 states to 21393 states and 23536 transitions.
[2025-03-16 15:26:01,400 INFO  L78                 Accepts]: Start accepts. Automaton has 21393 states and 23536 transitions. Word has length 963
[2025-03-16 15:26:01,402 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:01,402 INFO  L471      AbstractCegarLoop]: Abstraction has 21393 states and 23536 transitions.
[2025-03-16 15:26:01,402 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-16 15:26:01,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 21393 states and 23536 transitions.
[2025-03-16 15:26:01,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 997
[2025-03-16 15:26:01,408 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:01,409 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-16 15:26:01,410 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 15:26:01,410 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:01,410 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:01,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 2062918965, now seen corresponding path program 1 times
[2025-03-16 15:26:01,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:01,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562016679]
[2025-03-16 15:26:01,411 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:01,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:01,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 996 statements into 1 equivalence classes.
[2025-03-16 15:26:01,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 996 of 996 statements.
[2025-03-16 15:26:01,583 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:01,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:02,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 721 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked.
[2025-03-16 15:26:02,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:02,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562016679]
[2025-03-16 15:26:02,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562016679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:02,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:02,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:02,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571684318]
[2025-03-16 15:26:02,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:02,267 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:02,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:02,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:02,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:02,268 INFO  L87              Difference]: Start difference. First operand 21393 states and 23536 transitions. Second operand  has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 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-16 15:26:03,832 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:03,833 INFO  L93              Difference]: Finished difference Result 51755 states and 57379 transitions.
[2025-03-16 15:26:03,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:03,834 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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 996
[2025-03-16 15:26:03,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:03,886 INFO  L225             Difference]: With dead ends: 51755
[2025-03-16 15:26:03,887 INFO  L226             Difference]: Without dead ends: 30363
[2025-03-16 15:26:03,900 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-16 15:26:03,900 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 577 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:03,901 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 977 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 15:26:03,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30363 states.
[2025-03-16 15:26:04,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30363.
[2025-03-16 15:26:04,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30363 states, 30362 states have (on average 1.088169422304196) internal successors, (33039), 30362 states have internal predecessors, (33039), 0 states have call successors, (0), 0 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-16 15:26:04,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 33039 transitions.
[2025-03-16 15:26:04,211 INFO  L78                 Accepts]: Start accepts. Automaton has 30363 states and 33039 transitions. Word has length 996
[2025-03-16 15:26:04,211 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:04,211 INFO  L471      AbstractCegarLoop]: Abstraction has 30363 states and 33039 transitions.
[2025-03-16 15:26:04,212 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 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-16 15:26:04,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 30363 states and 33039 transitions.
[2025-03-16 15:26:04,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1004
[2025-03-16 15:26:04,227 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:04,228 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:04,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 15:26:04,228 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:04,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:04,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -826916424, now seen corresponding path program 1 times
[2025-03-16 15:26:04,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:04,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024601316]
[2025-03-16 15:26:04,231 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:04,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:04,321 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1003 statements into 1 equivalence classes.
[2025-03-16 15:26:04,349 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1003 of 1003 statements.
[2025-03-16 15:26:04,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:04,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:05,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 728 backedges. 360 proven. 368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 15:26:05,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:05,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024601316]
[2025-03-16 15:26:05,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024601316] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:05,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77643366]
[2025-03-16 15:26:05,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:05,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:05,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:05,361 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-16 15:26:05,363 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-16 15:26:05,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1003 statements into 1 equivalence classes.
[2025-03-16 15:26:05,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1003 of 1003 statements.
[2025-03-16 15:26:05,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:05,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:05,534 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:05,546 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:05,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 728 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked.
[2025-03-16 15:26:05,622 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:05,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [77643366] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:05,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:05,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2025-03-16 15:26:05,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834011187]
[2025-03-16 15:26:05,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:05,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:05,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:05,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:05,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 15:26:05,624 INFO  L87              Difference]: Start difference. First operand 30363 states and 33039 transitions. Second operand  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-16 15:26:06,997 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:06,998 INFO  L93              Difference]: Finished difference Result 60725 states and 66077 transitions.
[2025-03-16 15:26:06,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:06,998 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 1003
[2025-03-16 15:26:06,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:07,039 INFO  L225             Difference]: With dead ends: 60725
[2025-03-16 15:26:07,039 INFO  L226             Difference]: Without dead ends: 30363
[2025-03-16 15:26:07,060 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-16 15:26:07,060 INFO  L435           NwaCegarLoop]: 772 mSDtfsCounter, 732 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:07,061 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 778 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:07,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30363 states.
[2025-03-16 15:26:07,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30363.
[2025-03-16 15:26:07,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30363 states, 30362 states have (on average 1.0728212897701073) internal successors, (32573), 30362 states have internal predecessors, (32573), 0 states have call successors, (0), 0 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-16 15:26:07,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30363 states to 30363 states and 32573 transitions.
[2025-03-16 15:26:07,454 INFO  L78                 Accepts]: Start accepts. Automaton has 30363 states and 32573 transitions. Word has length 1003
[2025-03-16 15:26:07,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:07,455 INFO  L471      AbstractCegarLoop]: Abstraction has 30363 states and 32573 transitions.
[2025-03-16 15:26:07,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-16 15:26:07,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 30363 states and 32573 transitions.
[2025-03-16 15:26:07,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1134
[2025-03-16 15:26:07,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:07,490 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, 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, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:07,508 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-16 15:26:07,690 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,SelfDestructingSolverStorable9
[2025-03-16 15:26:07,691 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:07,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:07,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 139663283, now seen corresponding path program 1 times
[2025-03-16 15:26:07,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:07,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875655567]
[2025-03-16 15:26:07,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:07,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:07,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1133 statements into 1 equivalence classes.
[2025-03-16 15:26:07,811 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1133 of 1133 statements.
[2025-03-16 15:26:07,811 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:07,811 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:09,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 1372 backedges. 484 proven. 803 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-03-16 15:26:09,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:09,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875655567]
[2025-03-16 15:26:09,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875655567] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 15:26:09,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031626024]
[2025-03-16 15:26:09,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:09,048 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:09,048 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 15:26:09,050 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 15:26:09,050 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-16 15:26:09,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1133 statements into 1 equivalence classes.
[2025-03-16 15:26:09,251 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1133 of 1133 statements.
[2025-03-16 15:26:09,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:09,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:09,255 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 15:26:09,263 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 15:26:09,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 1372 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-16 15:26:09,365 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 15:26:09,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031626024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:09,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 15:26:09,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10
[2025-03-16 15:26:09,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128684309]
[2025-03-16 15:26:09,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:09,366 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:09,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:09,367 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:09,367 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-16 15:26:09,367 INFO  L87              Difference]: Start difference. First operand 30363 states and 32573 transitions. Second operand  has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-16 15:26:10,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:10,783 INFO  L93              Difference]: Finished difference Result 67625 states and 73336 transitions.
[2025-03-16 15:26:10,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:10,783 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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 1133
[2025-03-16 15:26:10,784 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:10,820 INFO  L225             Difference]: With dead ends: 67625
[2025-03-16 15:26:10,820 INFO  L226             Difference]: Without dead ends: 37263
[2025-03-16 15:26:10,840 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-16 15:26:10,841 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 698 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:10,841 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 164 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:26:10,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37263 states.
[2025-03-16 15:26:11,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37263 to 37263.
[2025-03-16 15:26:11,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37263 states, 37262 states have (on average 1.0753851108367773) internal successors, (40071), 37262 states have internal predecessors, (40071), 0 states have call successors, (0), 0 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-16 15:26:11,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37263 states to 37263 states and 40071 transitions.
[2025-03-16 15:26:11,143 INFO  L78                 Accepts]: Start accepts. Automaton has 37263 states and 40071 transitions. Word has length 1133
[2025-03-16 15:26:11,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:11,144 INFO  L471      AbstractCegarLoop]: Abstraction has 37263 states and 40071 transitions.
[2025-03-16 15:26:11,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-16 15:26:11,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 37263 states and 40071 transitions.
[2025-03-16 15:26:11,152 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1140
[2025-03-16 15:26:11,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:11,153 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, 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, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:11,159 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-16 15:26:11,353 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 15:26:11,353 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:11,354 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:11,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 60950882, now seen corresponding path program 1 times
[2025-03-16 15:26:11,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:11,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950844913]
[2025-03-16 15:26:11,354 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:11,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:11,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1139 statements into 1 equivalence classes.
[2025-03-16 15:26:11,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1139 of 1139 statements.
[2025-03-16 15:26:11,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:11,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:11,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 1387 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked.
[2025-03-16 15:26:11,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:11,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950844913]
[2025-03-16 15:26:11,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950844913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:11,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:11,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:11,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878366008]
[2025-03-16 15:26:11,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:11,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:11,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:11,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:11,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:11,985 INFO  L87              Difference]: Start difference. First operand 37263 states and 40071 transitions. Second operand  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-16 15:26:13,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:13,700 INFO  L93              Difference]: Finished difference Result 84185 states and 91368 transitions.
[2025-03-16 15:26:13,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:13,700 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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 1139
[2025-03-16 15:26:13,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:13,751 INFO  L225             Difference]: With dead ends: 84185
[2025-03-16 15:26:13,751 INFO  L226             Difference]: Without dead ends: 44163
[2025-03-16 15:26:13,777 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-16 15:26:13,777 INFO  L435           NwaCegarLoop]: 1113 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:13,777 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1119 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-16 15:26:13,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44163 states.
[2025-03-16 15:26:14,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44163 to 44163.
[2025-03-16 15:26:14,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44163 states, 44162 states have (on average 1.070105520583307) internal successors, (47258), 44162 states have internal predecessors, (47258), 0 states have call successors, (0), 0 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-16 15:26:14,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 47258 transitions.
[2025-03-16 15:26:14,191 INFO  L78                 Accepts]: Start accepts. Automaton has 44163 states and 47258 transitions. Word has length 1139
[2025-03-16 15:26:14,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:14,191 INFO  L471      AbstractCegarLoop]: Abstraction has 44163 states and 47258 transitions.
[2025-03-16 15:26:14,191 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-16 15:26:14,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 44163 states and 47258 transitions.
[2025-03-16 15:26:14,200 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1158
[2025-03-16 15:26:14,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:14,201 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-16 15:26:14,201 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 15:26:14,201 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:14,202 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:14,202 INFO  L85        PathProgramCache]: Analyzing trace with hash 656831079, now seen corresponding path program 1 times
[2025-03-16 15:26:14,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:14,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003571769]
[2025-03-16 15:26:14,202 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:14,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:14,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes.
[2025-03-16 15:26:14,276 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements.
[2025-03-16 15:26:14,276 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:14,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:15,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 1384 backedges. 781 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked.
[2025-03-16 15:26:15,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:15,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003571769]
[2025-03-16 15:26:15,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003571769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:15,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:15,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 15:26:15,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046003687]
[2025-03-16 15:26:15,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:15,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 15:26:15,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:15,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 15:26:15,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:15,030 INFO  L87              Difference]: Start difference. First operand 44163 states and 47258 transitions. Second operand  has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 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-16 15:26:16,934 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:16,934 INFO  L93              Difference]: Finished difference Result 95320 states and 103005 transitions.
[2025-03-16 15:26:16,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:16,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 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 1157
[2025-03-16 15:26:16,935 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:16,983 INFO  L225             Difference]: With dead ends: 95320
[2025-03-16 15:26:16,983 INFO  L226             Difference]: Without dead ends: 47708
[2025-03-16 15:26:17,003 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 15:26:17,004 INFO  L435           NwaCegarLoop]: 1047 mSDtfsCounter, 1372 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:17,004 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 1058 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 15:26:17,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47708 states.
[2025-03-16 15:26:17,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47708 to 44853.
[2025-03-16 15:26:17,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44853 states, 44852 states have (on average 1.0446133951663248) internal successors, (46853), 44852 states have internal predecessors, (46853), 0 states have call successors, (0), 0 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-16 15:26:17,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44853 states to 44853 states and 46853 transitions.
[2025-03-16 15:26:17,361 INFO  L78                 Accepts]: Start accepts. Automaton has 44853 states and 46853 transitions. Word has length 1157
[2025-03-16 15:26:17,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:17,362 INFO  L471      AbstractCegarLoop]: Abstraction has 44853 states and 46853 transitions.
[2025-03-16 15:26:17,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 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-16 15:26:17,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 44853 states and 46853 transitions.
[2025-03-16 15:26:17,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1373
[2025-03-16 15:26:17,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:17,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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:17,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 15:26:17,380 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:17,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:17,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1681345857, now seen corresponding path program 1 times
[2025-03-16 15:26:17,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:17,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598030288]
[2025-03-16 15:26:17,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:17,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:17,442 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1372 statements into 1 equivalence classes.
[2025-03-16 15:26:17,482 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1372 of 1372 statements.
[2025-03-16 15:26:17,483 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:17,483 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:18,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 2167 backedges. 1381 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked.
[2025-03-16 15:26:18,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:18,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598030288]
[2025-03-16 15:26:18,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598030288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:18,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:18,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:18,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233518114]
[2025-03-16 15:26:18,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:18,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:18,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:18,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:18,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:18,129 INFO  L87              Difference]: Start difference. First operand 44853 states and 46853 transitions. Second operand  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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-16 15:26:19,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:19,651 INFO  L93              Difference]: Finished difference Result 98675 states and 103424 transitions.
[2025-03-16 15:26:19,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:19,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1372
[2025-03-16 15:26:19,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:19,716 INFO  L225             Difference]: With dead ends: 98675
[2025-03-16 15:26:19,716 INFO  L226             Difference]: Without dead ends: 54513
[2025-03-16 15:26:19,748 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-16 15:26:19,748 INFO  L435           NwaCegarLoop]: 955 mSDtfsCounter, 455 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:19,748 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 961 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 15:26:19,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54513 states.
[2025-03-16 15:26:20,268 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54513 to 54513.
[2025-03-16 15:26:20,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54513 states, 54512 states have (on average 1.041348693865571) internal successors, (56766), 54512 states have internal predecessors, (56766), 0 states have call successors, (0), 0 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-16 15:26:20,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54513 states to 54513 states and 56766 transitions.
[2025-03-16 15:26:20,380 INFO  L78                 Accepts]: Start accepts. Automaton has 54513 states and 56766 transitions. Word has length 1372
[2025-03-16 15:26:20,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:20,381 INFO  L471      AbstractCegarLoop]: Abstraction has 54513 states and 56766 transitions.
[2025-03-16 15:26:20,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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-16 15:26:20,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 54513 states and 56766 transitions.
[2025-03-16 15:26:20,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1402
[2025-03-16 15:26:20,414 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:20,415 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 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-16 15:26:20,415 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 15:26:20,415 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:20,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:20,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -585744167, now seen corresponding path program 1 times
[2025-03-16 15:26:20,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:20,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240401951]
[2025-03-16 15:26:20,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:20,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:20,512 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1401 statements into 1 equivalence classes.
[2025-03-16 15:26:20,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1401 of 1401 statements.
[2025-03-16 15:26:20,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:20,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:21,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 2331 backedges. 1537 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked.
[2025-03-16 15:26:21,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:21,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240401951]
[2025-03-16 15:26:21,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240401951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:21,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:21,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:21,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055332519]
[2025-03-16 15:26:21,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:21,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 15:26:21,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:21,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 15:26:21,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-16 15:26:21,452 INFO  L87              Difference]: Start difference. First operand 54513 states and 56766 transitions. Second operand  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 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-16 15:26:23,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:23,421 INFO  L93              Difference]: Finished difference Result 115235 states and 120175 transitions.
[2025-03-16 15:26:23,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 15:26:23,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 1401
[2025-03-16 15:26:23,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:23,482 INFO  L225             Difference]: With dead ends: 115235
[2025-03-16 15:26:23,483 INFO  L226             Difference]: Without dead ends: 61413
[2025-03-16 15:26:23,513 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-16 15:26:23,513 INFO  L435           NwaCegarLoop]: 79 mSDtfsCounter, 980 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:23,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 90 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2680 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 15:26:23,548 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61413 states.
[2025-03-16 15:26:23,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 60033.
[2025-03-16 15:26:23,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60033 states, 60032 states have (on average 1.0412946428571428) internal successors, (62511), 60032 states have internal predecessors, (62511), 0 states have call successors, (0), 0 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-16 15:26:24,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 62511 transitions.
[2025-03-16 15:26:24,035 INFO  L78                 Accepts]: Start accepts. Automaton has 60033 states and 62511 transitions. Word has length 1401
[2025-03-16 15:26:24,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:24,036 INFO  L471      AbstractCegarLoop]: Abstraction has 60033 states and 62511 transitions.
[2025-03-16 15:26:24,036 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 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-16 15:26:24,036 INFO  L276                IsEmpty]: Start isEmpty. Operand 60033 states and 62511 transitions.
[2025-03-16 15:26:24,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1481
[2025-03-16 15:26:24,056 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:24,057 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:24,057 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 15:26:24,057 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:24,057 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:24,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -659653644, now seen corresponding path program 1 times
[2025-03-16 15:26:24,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:24,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891707083]
[2025-03-16 15:26:24,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:24,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:24,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1480 statements into 1 equivalence classes.
[2025-03-16 15:26:24,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1480 of 1480 statements.
[2025-03-16 15:26:24,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:24,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:25,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 2900 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked.
[2025-03-16 15:26:25,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:25,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891707083]
[2025-03-16 15:26:25,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891707083] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:25,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:25,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:25,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628197010]
[2025-03-16 15:26:25,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:25,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:25,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:25,436 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:25,436 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:25,436 INFO  L87              Difference]: Start difference. First operand 60033 states and 62511 transitions. Second operand  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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-16 15:26:26,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:26,712 INFO  L93              Difference]: Finished difference Result 120755 states and 125731 transitions.
[2025-03-16 15:26:26,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:26,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 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 1480
[2025-03-16 15:26:26,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:26,772 INFO  L225             Difference]: With dead ends: 120755
[2025-03-16 15:26:26,772 INFO  L226             Difference]: Without dead ends: 60723
[2025-03-16 15:26:26,805 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-16 15:26:26,805 INFO  L435           NwaCegarLoop]: 751 mSDtfsCounter, 645 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:26,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 756 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 15:26:26,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60723 states.
[2025-03-16 15:26:27,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 60723.
[2025-03-16 15:26:27,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60723 states, 60722 states have (on average 1.035884852277593) internal successors, (62901), 60722 states have internal predecessors, (62901), 0 states have call successors, (0), 0 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-16 15:26:27,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 62901 transitions.
[2025-03-16 15:26:27,266 INFO  L78                 Accepts]: Start accepts. Automaton has 60723 states and 62901 transitions. Word has length 1480
[2025-03-16 15:26:27,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:27,267 INFO  L471      AbstractCegarLoop]: Abstraction has 60723 states and 62901 transitions.
[2025-03-16 15:26:27,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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-16 15:26:27,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 60723 states and 62901 transitions.
[2025-03-16 15:26:27,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1535
[2025-03-16 15:26:27,287 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 15:26:27,287 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:27,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 15:26:27,288 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 15:26:27,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 15:26:27,288 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418547929, now seen corresponding path program 1 times
[2025-03-16 15:26:27,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 15:26:27,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86032867]
[2025-03-16 15:26:27,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 15:26:27,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 15:26:27,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1534 statements into 1 equivalence classes.
[2025-03-16 15:26:27,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1534 of 1534 statements.
[2025-03-16 15:26:27,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 15:26:27,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 15:26:28,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 3389 backedges. 1810 proven. 0 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked.
[2025-03-16 15:26:28,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 15:26:28,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86032867]
[2025-03-16 15:26:28,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86032867] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 15:26:28,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 15:26:28,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 15:26:28,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110338655]
[2025-03-16 15:26:28,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 15:26:28,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 15:26:28,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 15:26:28,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 15:26:28,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 15:26:28,239 INFO  L87              Difference]: Start difference. First operand 60723 states and 62901 transitions. Second operand  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-16 15:26:29,762 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 15:26:29,762 INFO  L93              Difference]: Finished difference Result 120753 states and 125109 transitions.
[2025-03-16 15:26:29,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 15:26:29,762 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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 1534
[2025-03-16 15:26:29,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 15:26:29,764 INFO  L225             Difference]: With dead ends: 120753
[2025-03-16 15:26:29,764 INFO  L226             Difference]: Without dead ends: 0
[2025-03-16 15:26:29,807 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-16 15:26:29,807 INFO  L435           NwaCegarLoop]: 938 mSDtfsCounter, 625 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-16 15:26:29,807 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 943 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-16 15:26:29,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-16 15:26:29,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-16 15:26:29,808 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-16 15:26:29,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-16 15:26:29,808 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1534
[2025-03-16 15:26:29,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 15:26:29,808 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-16 15:26:29,808 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-16 15:26:29,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-16 15:26:29,809 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-16 15:26:29,811 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-16 15:26:29,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 15:26:29,814 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 15:26:29,815 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-16 15:26:30,800 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-16 15:26:30,813 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:26:30 BoogieIcfgContainer
[2025-03-16 15:26:30,814 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-16 15:26:30,814 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-16 15:26:30,814 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-16 15:26:30,814 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-16 15:26:30,815 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:41" (3/4) ...
[2025-03-16 15:26:30,816 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-16 15:26:30,850 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-03-16 15:26:30,853 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-16 15:26:30,857 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-16 15:26:30,860 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-16 15:26:31,021 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-16 15:26:31,021 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-16 15:26:31,021 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-16 15:26:31,022 INFO  L158              Benchmark]: Toolchain (without parser) took 53125.41ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 103.0MB in the beginning and 999.4MB in the end (delta: -896.4MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,022 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 15:26:31,023 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 720.32ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 58.8MB in the end (delta: 44.2MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,023 INFO  L158              Benchmark]: Boogie Procedure Inliner took 176.22ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 71.1MB in the end (delta: -12.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,024 INFO  L158              Benchmark]: Boogie Preprocessor took 223.12ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 55.3MB in the end (delta: 15.8MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,024 INFO  L158              Benchmark]: IcfgBuilder took 2873.17ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 55.3MB in the beginning and 191.4MB in the end (delta: -136.1MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,024 INFO  L158              Benchmark]: TraceAbstraction took 48919.63ms. Allocated memory was 285.2MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 191.4MB in the beginning and 1.0GB in the end (delta: -854.0MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,024 INFO  L158              Benchmark]: Witness Printer took 207.33ms. Allocated memory is still 3.0GB. Free memory was 1.0GB in the beginning and 999.4MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-16 15:26:31,025 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.19ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 720.32ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 58.8MB in the end (delta: 44.2MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 176.22ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 71.1MB in the end (delta: -12.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 223.12ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 55.3MB in the end (delta: 15.8MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2873.17ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 55.3MB in the beginning and 191.4MB in the end (delta: -136.1MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 48919.63ms. Allocated memory was 285.2MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 191.4MB in the beginning and 1.0GB in the end (delta: -854.0MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
 * Witness Printer took 207.33ms. Allocated memory is still 3.0GB. Free memory was 1.0GB in the beginning and 999.4MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. 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: 214]: 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, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.9s, OverallIterations: 17, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11544 SdHoareTripleChecker+Valid, 25.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11544 mSDsluCounter, 11169 SdHoareTripleChecker+Invalid, 20.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 7198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34530 IncrementalHoareTripleChecker+Invalid, 41728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7198 mSolverCounterUnsat, 11051 mSDtfsCounter, 34530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3075 GetRequests, 3039 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60723occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 6311 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 17026 NumberOfCodeBlocks, 17026 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 17006 ConstructedInterpolants, 0 QuantifiedInterpolants, 49775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3455 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 19155/20408 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: 4269]: Location Invariant
    Derived location invariant: ((((((((((((((5 == a15) && (a18 == 10)) || ((a24 <= 3) && (a18 <= 9))) || ((a18 == 11) && (a24 <= 3))) || ((a24 == 0) && (a15 <= 4))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 12))) || ((a18 <= 9) && (a15 <= 5))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 10))) || ((5 == a15) && (a18 == 11))) || (((5 == a15) && (a18 == 12)) && (a3 <= 99))) || (((a18 == 10) && (a24 <= 3)) && (5 <= a15))) || (((a24 <= 3) && (a18 == 12)) && (5 <= a15))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a18 == 11)))
RESULT: Ultimate proved your program to be correct!
[2025-03-16 15:26:31,043 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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