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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
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/Problem01_label00.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 ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:47:32,382 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:47:32,436 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:47:32,443 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:47:32,443 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:47:32,468 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:47:32,469 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:47:32,469 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:47:32,469 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:47:32,470 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:47:32,470 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:47:32,470 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:47:32,471 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:47:32,471 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:47:32,471 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:47:32,471 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:47:32,472 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:47:32,472 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:47:32,472 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 -> ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a
[2025-03-03 09:47:32,682 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:47:32,690 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:47:32,692 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:47:32,693 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:47:32,693 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:47:32,694 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label00.c
[2025-03-03 09:47:33,845 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2878b8/c710b862f03143b4aa081bf95e0040a0/FLAG0ea837e0c
[2025-03-03 09:47:34,104 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:47:34,105 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label00.c
[2025-03-03 09:47:34,113 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2878b8/c710b862f03143b4aa081bf95e0040a0/FLAG0ea837e0c
[2025-03-03 09:47:34,417 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2878b8/c710b862f03143b4aa081bf95e0040a0
[2025-03-03 09:47:34,419 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:47:34,420 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:47:34,421 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:47:34,421 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:47:34,424 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:47:34,424 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,425 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5ffcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34, skipping insertion in model container
[2025-03-03 09:47:34,425 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,454 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:47:34,633 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/Problem01_label00.c[18976,18989]
[2025-03-03 09:47:34,651 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:47:34,658 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:47:34,712 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/Problem01_label00.c[18976,18989]
[2025-03-03 09:47:34,721 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:47:34,733 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:47:34,733 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34 WrapperNode
[2025-03-03 09:47:34,734 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:47:34,734 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:47:34,734 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:47:34,734 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:47:34,738 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,747 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,776 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655
[2025-03-03 09:47:34,776 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:47:34,777 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:47:34,777 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:47:34,777 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:47:34,782 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,783 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,785 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,810 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-03 09:47:34,810 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,810 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,823 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,826 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,832 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,833 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,843 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:47:34,845 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:47:34,845 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:47:34,845 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:47:34,846 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (1/1) ...
[2025-03-03 09:47:34,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:47:34,859 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:47:34,870 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-03 09:47:34,874 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-03 09:47:34,894 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:47:34,895 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:47:34,895 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:47:34,895 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:47:34,948 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:47:34,950 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:47:35,660 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2025-03-03 09:47:35,660 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:47:35,673 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:47:35,675 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:47:35,675 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:47:35 BoogieIcfgContainer
[2025-03-03 09:47:35,675 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:47:35,677 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:47:35,678 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:47:35,681 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:47:35,681 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:47:34" (1/3) ...
[2025-03-03 09:47:35,681 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d2b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:47:35, skipping insertion in model container
[2025-03-03 09:47:35,681 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:47:34" (2/3) ...
[2025-03-03 09:47:35,682 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d2b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:47:35, skipping insertion in model container
[2025-03-03 09:47:35,682 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:47:35" (3/3) ...
[2025-03-03 09:47:35,683 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem01_label00.c
[2025-03-03 09:47:35,694 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:47:35,696 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label00.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:47:35,747 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:47:35,760 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;@50310a18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:47:35,762 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:47:35,767 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:35,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-03-03 09:47:35,776 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:35,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:35,777 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:35,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:35,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208127335, now seen corresponding path program 1 times
[2025-03-03 09:47:35,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:35,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101010340]
[2025-03-03 09:47:35,791 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:35,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:35,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-03-03 09:47:35,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-03-03 09:47:35,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:35,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:36,553 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-03 09:47:36,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:36,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101010340]
[2025-03-03 09:47:36,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101010340] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:36,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:36,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:47:36,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520399752]
[2025-03-03 09:47:36,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:36,558 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:47:36,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:36,575 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:47:36,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:47:36,578 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:37,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:37,609 INFO  L93              Difference]: Finished difference Result 662 states and 1174 transitions.
[2025-03-03 09:47:37,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 09:47:37,611 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2025-03-03 09:47:37,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:37,620 INFO  L225             Difference]: With dead ends: 662
[2025-03-03 09:47:37,620 INFO  L226             Difference]: Without dead ends: 397
[2025-03-03 09:47:37,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:47:37,628 INFO  L435           NwaCegarLoop]: 53 mSDtfsCounter, 360 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:37,630 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 77 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 09:47:37,642 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2025-03-03 09:47:37,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397.
[2025-03-03 09:47:37,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:37,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions.
[2025-03-03 09:47:37,688 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 108
[2025-03-03 09:47:37,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:37,688 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 517 transitions.
[2025-03-03 09:47:37,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:37,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions.
[2025-03-03 09:47:37,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-03 09:47:37,692 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:37,692 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:47:37,692 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:47:37,692 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:37,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:37,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -88996346, now seen corresponding path program 1 times
[2025-03-03 09:47:37,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:37,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402536529]
[2025-03-03 09:47:37,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:37,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:37,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-03 09:47:37,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-03 09:47:37,735 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:37,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:38,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:47:38,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:38,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402536529]
[2025-03-03 09:47:38,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402536529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:38,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:38,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:38,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714611568]
[2025-03-03 09:47:38,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:38,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:47:38,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:38,005 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:47:38,006 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:47:38,007 INFO  L87              Difference]: Start difference. First operand 397 states and 517 transitions. Second operand  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:38,508 INFO  L93              Difference]: Finished difference Result 1018 states and 1433 transitions.
[2025-03-03 09:47:38,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:47:38,508 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2025-03-03 09:47:38,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:38,511 INFO  L225             Difference]: With dead ends: 1018
[2025-03-03 09:47:38,511 INFO  L226             Difference]: Without dead ends: 659
[2025-03-03 09:47:38,512 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-03 09:47:38,512 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 128 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:38,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:47:38,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2025-03-03 09:47:38,533 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528.
[2025-03-03 09:47:38,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.1555977229601517) internal successors, (609), 527 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 609 transitions.
[2025-03-03 09:47:38,539 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 609 transitions. Word has length 115
[2025-03-03 09:47:38,540 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:38,540 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 609 transitions.
[2025-03-03 09:47:38,540 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,540 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 609 transitions.
[2025-03-03 09:47:38,542 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-03 09:47:38,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:38,542 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:38,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:47:38,542 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:38,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:38,543 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452990371, now seen corresponding path program 1 times
[2025-03-03 09:47:38,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:38,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138350328]
[2025-03-03 09:47:38,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:38,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:38,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-03 09:47:38,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-03 09:47:38,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:38,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:38,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:47:38,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:38,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138350328]
[2025-03-03 09:47:38,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138350328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:38,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:38,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:47:38,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287306427]
[2025-03-03 09:47:38,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:38,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:47:38,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:38,692 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:47:38,692 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:47:38,692 INFO  L87              Difference]: Start difference. First operand 528 states and 609 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:38,956 INFO  L93              Difference]: Finished difference Result 1185 states and 1375 transitions.
[2025-03-03 09:47:38,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:47:38,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2025-03-03 09:47:38,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:38,959 INFO  L225             Difference]: With dead ends: 1185
[2025-03-03 09:47:38,959 INFO  L226             Difference]: Without dead ends: 659
[2025-03-03 09:47:38,960 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-03 09:47:38,961 INFO  L435           NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:38,962 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:47:38,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2025-03-03 09:47:38,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2025-03-03 09:47:38,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 659 states, 658 states have (on average 1.1428571428571428) internal successors, (752), 658 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 752 transitions.
[2025-03-03 09:47:38,978 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 752 transitions. Word has length 120
[2025-03-03 09:47:38,979 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:38,979 INFO  L471      AbstractCegarLoop]: Abstraction has 659 states and 752 transitions.
[2025-03-03 09:47:38,979 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:38,979 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 752 transitions.
[2025-03-03 09:47:38,981 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-03 09:47:38,981 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:38,981 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:47:38,981 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:47:38,981 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:38,982 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:38,982 INFO  L85        PathProgramCache]: Analyzing trace with hash 94960535, now seen corresponding path program 1 times
[2025-03-03 09:47:38,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:38,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063973095]
[2025-03-03 09:47:38,983 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:38,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:39,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-03 09:47:39,008 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-03 09:47:39,009 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:39,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:39,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:47:39,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:39,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063973095]
[2025-03-03 09:47:39,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063973095] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:39,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:39,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:39,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480340204]
[2025-03-03 09:47:39,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:39,087 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:47:39,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:39,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:47:39,088 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:47:39,088 INFO  L87              Difference]: Start difference. First operand 659 states and 752 transitions. Second operand  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:39,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:39,374 INFO  L93              Difference]: Finished difference Result 1840 states and 2117 transitions.
[2025-03-03 09:47:39,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:47:39,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 129
[2025-03-03 09:47:39,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:39,377 INFO  L225             Difference]: With dead ends: 1840
[2025-03-03 09:47:39,377 INFO  L226             Difference]: Without dead ends: 1183
[2025-03-03 09:47:39,378 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-03 09:47:39,380 INFO  L435           NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:39,381 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:47:39,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2025-03-03 09:47:39,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052.
[2025-03-03 09:47:39,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1052 states, 1051 states have (on average 1.1693625118934348) internal successors, (1229), 1051 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:39,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1229 transitions.
[2025-03-03 09:47:39,401 INFO  L78                 Accepts]: Start accepts. Automaton has 1052 states and 1229 transitions. Word has length 129
[2025-03-03 09:47:39,401 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:39,401 INFO  L471      AbstractCegarLoop]: Abstraction has 1052 states and 1229 transitions.
[2025-03-03 09:47:39,401 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:39,401 INFO  L276                IsEmpty]: Start isEmpty. Operand 1052 states and 1229 transitions.
[2025-03-03 09:47:39,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-03 09:47:39,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:39,403 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:39,403 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:47:39,403 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:39,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:39,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -777644984, now seen corresponding path program 1 times
[2025-03-03 09:47:39,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:39,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612840350]
[2025-03-03 09:47:39,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:39,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:39,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 09:47:39,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 09:47:39,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:39,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:39,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:47:39,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:39,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612840350]
[2025-03-03 09:47:39,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612840350] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:39,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:39,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:39,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514534997]
[2025-03-03 09:47:39,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:39,508 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:47:39,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:39,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:47:39,508 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:47:39,508 INFO  L87              Difference]: Start difference. First operand 1052 states and 1229 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 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-03 09:47:39,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:39,948 INFO  L93              Difference]: Finished difference Result 2626 states and 3127 transitions.
[2025-03-03 09:47:39,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:47:39,949 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 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 135
[2025-03-03 09:47:39,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:39,953 INFO  L225             Difference]: With dead ends: 2626
[2025-03-03 09:47:39,953 INFO  L226             Difference]: Without dead ends: 1576
[2025-03-03 09:47:39,954 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-03 09:47:39,955 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:39,956 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 34 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:47:39,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2025-03-03 09:47:39,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445.
[2025-03-03 09:47:39,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1445 states, 1444 states have (on average 1.1544321329639888) internal successors, (1667), 1444 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:39,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1667 transitions.
[2025-03-03 09:47:39,987 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1667 transitions. Word has length 135
[2025-03-03 09:47:39,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:39,987 INFO  L471      AbstractCegarLoop]: Abstraction has 1445 states and 1667 transitions.
[2025-03-03 09:47:39,987 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 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-03 09:47:39,988 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1667 transitions.
[2025-03-03 09:47:39,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-03 09:47:39,989 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:39,989 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:39,990 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:47:39,990 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:39,990 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:39,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -939355675, now seen corresponding path program 1 times
[2025-03-03 09:47:39,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:39,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061621427]
[2025-03-03 09:47:39,990 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:39,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:40,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-03 09:47:40,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-03 09:47:40,017 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:40,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:40,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:47:40,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:40,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061621427]
[2025-03-03 09:47:40,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061621427] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:40,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:40,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:40,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912065155]
[2025-03-03 09:47:40,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:40,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:47:40,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:40,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:47:40,122 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:47:40,122 INFO  L87              Difference]: Start difference. First operand 1445 states and 1667 transitions. Second operand  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:40,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:40,569 INFO  L93              Difference]: Finished difference Result 3543 states and 4040 transitions.
[2025-03-03 09:47:40,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:47:40,570 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-03 09:47:40,570 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:40,574 INFO  L225             Difference]: With dead ends: 3543
[2025-03-03 09:47:40,575 INFO  L226             Difference]: Without dead ends: 1838
[2025-03-03 09:47:40,576 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-03 09:47:40,577 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 248 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:40,577 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 40 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:47:40,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2025-03-03 09:47:40,596 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576.
[2025-03-03 09:47:40,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.1257142857142857) internal successors, (1773), 1575 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:40,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1773 transitions.
[2025-03-03 09:47:40,602 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1773 transitions. Word has length 149
[2025-03-03 09:47:40,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:40,603 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1773 transitions.
[2025-03-03 09:47:40,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:40,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1773 transitions.
[2025-03-03 09:47:40,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-03 09:47:40,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:40,606 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:40,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:47:40,606 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:40,606 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:40,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 650553631, now seen corresponding path program 1 times
[2025-03-03 09:47:40,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:40,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482312941]
[2025-03-03 09:47:40,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:40,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:40,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-03 09:47:40,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-03 09:47:40,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:40,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:40,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-03-03 09:47:40,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:40,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482312941]
[2025-03-03 09:47:40,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482312941] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:40,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:40,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:40,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432379095]
[2025-03-03 09:47:40,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:40,736 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:47:40,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:40,737 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:47:40,737 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:47:40,737 INFO  L87              Difference]: Start difference. First operand 1576 states and 1773 transitions. Second operand  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,016 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:41,016 INFO  L93              Difference]: Finished difference Result 3412 states and 3846 transitions.
[2025-03-03 09:47:41,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:47:41,017 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 169
[2025-03-03 09:47:41,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:41,022 INFO  L225             Difference]: With dead ends: 3412
[2025-03-03 09:47:41,022 INFO  L226             Difference]: Without dead ends: 1969
[2025-03-03 09:47:41,023 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-03 09:47:41,024 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:41,025 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 37 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:47:41,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2025-03-03 09:47:41,047 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2025-03-03 09:47:41,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1283704572098476) internal successors, (1925), 1706 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1925 transitions.
[2025-03-03 09:47:41,054 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1925 transitions. Word has length 169
[2025-03-03 09:47:41,055 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:41,055 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1925 transitions.
[2025-03-03 09:47:41,055 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1925 transitions.
[2025-03-03 09:47:41,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 09:47:41,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:41,058 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:41,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 09:47:41,058 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:41,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:41,060 INFO  L85        PathProgramCache]: Analyzing trace with hash 518813557, now seen corresponding path program 1 times
[2025-03-03 09:47:41,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:41,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065728455]
[2025-03-03 09:47:41,060 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:41,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:41,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 09:47:41,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 09:47:41,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:41,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:41,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 161 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-03-03 09:47:41,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:41,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065728455]
[2025-03-03 09:47:41,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065728455] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:41,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:41,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:41,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995206229]
[2025-03-03 09:47:41,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:41,230 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:47:41,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:41,230 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:47:41,230 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:47:41,230 INFO  L87              Difference]: Start difference. First operand 1707 states and 1925 transitions. Second operand  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:41,684 INFO  L93              Difference]: Finished difference Result 3543 states and 4064 transitions.
[2025-03-03 09:47:41,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:47:41,684 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 194
[2025-03-03 09:47:41,685 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:41,689 INFO  L225             Difference]: With dead ends: 3543
[2025-03-03 09:47:41,690 INFO  L226             Difference]: Without dead ends: 1969
[2025-03-03 09:47:41,691 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-03 09:47:41,692 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 253 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:41,692 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 44 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:47:41,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2025-03-03 09:47:41,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969.
[2025-03-03 09:47:41,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.1341463414634145) internal successors, (2232), 1968 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2232 transitions.
[2025-03-03 09:47:41,720 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2232 transitions. Word has length 194
[2025-03-03 09:47:41,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:41,720 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2232 transitions.
[2025-03-03 09:47:41,720 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:41,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2232 transitions.
[2025-03-03 09:47:41,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-03 09:47:41,723 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:41,724 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:47:41,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:47:41,724 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:41,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:41,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507144183, now seen corresponding path program 1 times
[2025-03-03 09:47:41,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:41,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930128066]
[2025-03-03 09:47:41,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:41,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:41,743 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-03 09:47:41,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-03 09:47:41,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:41,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:41,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-03-03 09:47:41,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:41,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930128066]
[2025-03-03 09:47:41,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930128066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:41,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:41,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 09:47:41,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135031780]
[2025-03-03 09:47:41,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:41,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:47:41,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:41,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:47:41,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:47:41,962 INFO  L87              Difference]: Start difference. First operand 1969 states and 2232 transitions. Second operand  has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:42,363 INFO  L93              Difference]: Finished difference Result 3943 states and 4474 transitions.
[2025-03-03 09:47:42,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:47:42,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 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 212
[2025-03-03 09:47:42,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:42,368 INFO  L225             Difference]: With dead ends: 3943
[2025-03-03 09:47:42,368 INFO  L226             Difference]: Without dead ends: 2107
[2025-03-03 09:47:42,370 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-03 09:47:42,370 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 134 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:42,371 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 183 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:47:42,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2107 states.
[2025-03-03 09:47:42,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1969.
[2025-03-03 09:47:42,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.1158536585365855) internal successors, (2196), 1968 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2196 transitions.
[2025-03-03 09:47:42,397 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2196 transitions. Word has length 212
[2025-03-03 09:47:42,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:42,397 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2196 transitions.
[2025-03-03 09:47:42,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2196 transitions.
[2025-03-03 09:47:42,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-03 09:47:42,400 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:42,400 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:47:42,401 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:47:42,401 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:42,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:42,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -474017920, now seen corresponding path program 1 times
[2025-03-03 09:47:42,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:42,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055933168]
[2025-03-03 09:47:42,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:42,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:42,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-03 09:47:42,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-03 09:47:42,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:42,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:42,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-03-03 09:47:42,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:42,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055933168]
[2025-03-03 09:47:42,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055933168] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:42,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:47:42,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:47:42,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22742269]
[2025-03-03 09:47:42,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:42,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:47:42,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:42,527 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:47:42,527 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:47:42,527 INFO  L87              Difference]: Start difference. First operand 1969 states and 2196 transitions. Second operand  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:42,824 INFO  L93              Difference]: Finished difference Result 4067 states and 4555 transitions.
[2025-03-03 09:47:42,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:47:42,825 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 225
[2025-03-03 09:47:42,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:42,830 INFO  L225             Difference]: With dead ends: 4067
[2025-03-03 09:47:42,830 INFO  L226             Difference]: Without dead ends: 2100
[2025-03-03 09:47:42,832 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-03 09:47:42,833 INFO  L435           NwaCegarLoop]: 163 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:42,833 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 169 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:47:42,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2025-03-03 09:47:42,860 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100.
[2025-03-03 09:47:42,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2100 states, 2099 states have (on average 1.1090995712243925) internal successors, (2328), 2099 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2328 transitions.
[2025-03-03 09:47:42,866 INFO  L78                 Accepts]: Start accepts. Automaton has 2100 states and 2328 transitions. Word has length 225
[2025-03-03 09:47:42,867 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:42,867 INFO  L471      AbstractCegarLoop]: Abstraction has 2100 states and 2328 transitions.
[2025-03-03 09:47:42,867 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:42,867 INFO  L276                IsEmpty]: Start isEmpty. Operand 2100 states and 2328 transitions.
[2025-03-03 09:47:42,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-03 09:47:42,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:47:42,871 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:47:42,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:47:42,871 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:47:42,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:47:42,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 1001793056, now seen corresponding path program 1 times
[2025-03-03 09:47:42,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:47:42,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128938135]
[2025-03-03 09:47:42,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:42,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:47:42,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-03 09:47:42,910 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-03 09:47:42,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:42,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:43,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 218 backedges. 124 proven. 67 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-03-03 09:47:43,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:47:43,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128938135]
[2025-03-03 09:47:43,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128938135] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:47:43,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400061287]
[2025-03-03 09:47:43,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:47:43,049 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:47:43,049 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:47:43,051 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-03 09:47:43,067 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-03 09:47:43,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-03 09:47:43,163 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-03 09:47:43,163 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:47:43,163 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:47:43,165 INFO  L256         TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:47:43,172 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:47:43,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-03-03 09:47:43,321 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:47:43,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [400061287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:47:43,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:47:43,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 09:47:43,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360976440]
[2025-03-03 09:47:43,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:47:43,323 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:47:43,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:47:43,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:47:43,324 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:47:43,324 INFO  L87              Difference]: Start difference. First operand 2100 states and 2328 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:43,607 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:47:43,607 INFO  L93              Difference]: Finished difference Result 4196 states and 4653 transitions.
[2025-03-03 09:47:43,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:47:43,608 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234
[2025-03-03 09:47:43,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:47:43,608 INFO  L225             Difference]: With dead ends: 4196
[2025-03-03 09:47:43,608 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:47:43,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 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-03 09:47:43,611 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:47:43,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:47:43,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:47:43,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:47:43,612 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-03 09:47:43,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:47:43,612 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234
[2025-03-03 09:47:43,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:47:43,613 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:47:43,613 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:47:43,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:47:43,613 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:47:43,616 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:47:43,623 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 09:47:43,816 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-03-03 09:47:43,819 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:47:43,821 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:47:44,009 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:47:44,026 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:47:44 BoogieIcfgContainer
[2025-03-03 09:47:44,027 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:47:44,027 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:47:44,027 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:47:44,027 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:47:44,028 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:47:35" (3/4) ...
[2025-03-03 09:47:44,030 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:47:44,045 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-03 09:47:44,046 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:47:44,046 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:47:44,047 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:47:44,151 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:47:44,151 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:47:44,151 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:47:44,153 INFO  L158              Benchmark]: Toolchain (without parser) took 9731.84ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 105.8MB in the beginning and 205.0MB in the end (delta: -99.2MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,153 INFO  L158              Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:47:44,153 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 312.85ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 77.9MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,153 INFO  L158              Benchmark]: Boogie Procedure Inliner took 41.99ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 72.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,153 INFO  L158              Benchmark]: Boogie Preprocessor took 66.76ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:47:44,154 INFO  L158              Benchmark]: IcfgBuilder took 830.79ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 53.0MB in the end (delta: 15.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,154 INFO  L158              Benchmark]: TraceAbstraction took 8349.63ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 217.6MB in the end (delta: -165.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,154 INFO  L158              Benchmark]: Witness Printer took 124.49ms. Allocated memory is still 377.5MB. Free memory was 217.6MB in the beginning and 205.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 09:47:44,155 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 312.85ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 77.9MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 41.99ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 72.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 66.76ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 830.79ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 53.0MB in the end (delta: 15.6MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8349.63ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 217.6MB in the end (delta: -165.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB.
 * Witness Printer took 124.49ms. Allocated memory is still 377.5MB. Free memory was 217.6MB in the beginning and 205.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 510]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1867 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1867 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 857 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5312 IncrementalHoareTripleChecker+Invalid, 6169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 857 mSolverCounterUnsat, 808 mSDtfsCounter, 5312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1055 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2024 NumberOfCodeBlocks, 2024 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2012 ConstructedInterpolants, 0 QuantifiedInterpolants, 7827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1164/1231 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: 593]: Location Invariant
    Derived location invariant: ((((((((((a16 == 6) && (a21 <= 0)) || ((a21 <= 0) && (a16 <= 5))) || (((a20 != 1) && (a21 == 1)) && (a16 <= 4))) || (((a21 == 1) && (a16 <= 5)) && (a8 != 13))) || (((a16 == 6) && (a21 == 1)) && (a8 != 13))) || (((((a12 == 8) && (a16 == 6)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4))) || (((a7 != 1) && (a21 == 1)) && (a16 <= 4))) || (((a21 == 1) && (a20 == 1)) && (a8 != 13)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:47:44,171 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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