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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label38.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:33:23,216 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:33:23,316 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:33:23,321 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:33:23,321 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:33:23,344 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:33:23,345 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:33:23,345 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:33:23,346 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:33:23,346 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:33:23,346 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:33:23,346 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:33:23,346 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:33:23,346 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:33:23,346 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:33:23,347 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:33:23,347 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:33:23,348 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:33:23,348 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:33:23,349 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:33:23,349 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:33:23,350 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:33:23,350 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:33:23,350 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:33:23,350 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:33:23,350 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:33:23,350 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-jdk21/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 -> 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06
[2025-02-05 11:33:23,741 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:33:23,766 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:33:23,773 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:33:23,780 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:33:23,780 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:33:23,781 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label38.c
[2025-02-05 11:33:25,559 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d67c9cbbd/950f9dc6184b4e728b560f91b1035212/FLAGd50cb6c71
[2025-02-05 11:33:26,058 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:33:26,060 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c
[2025-02-05 11:33:26,075 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d67c9cbbd/950f9dc6184b4e728b560f91b1035212/FLAGd50cb6c71
[2025-02-05 11:33:26,093 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d67c9cbbd/950f9dc6184b4e728b560f91b1035212
[2025-02-05 11:33:26,096 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:33:26,099 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:33:26,100 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:33:26,102 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:33:26,106 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:33:26,110 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:26,112 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b96a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26, skipping insertion in model container
[2025-02-05 11:33:26,117 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:26,189 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:33:26,494 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c[8652,8665]
[2025-02-05 11:33:26,790 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:33:26,799 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:33:26,831 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c[8652,8665]
[2025-02-05 11:33:26,917 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:33:26,930 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:33:26,931 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26 WrapperNode
[2025-02-05 11:33:26,931 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:33:26,933 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:33:26,933 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:33:26,933 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:33:26,938 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:26,968 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,086 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997
[2025-02-05 11:33:27,087 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:33:27,088 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:33:27,088 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:33:27,088 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:33:27,098 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,100 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,110 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,191 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-02-05 11:33:27,196 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,196 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,277 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,288 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,308 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,321 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,349 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:33:27,362 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:33:27,362 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:33:27,362 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:33:27,363 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (1/1) ...
[2025-02-05 11:33:27,410 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:33:27,423 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:33:27,455 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:33:27,470 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:33:27,515 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:33:27,515 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:33:27,516 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:33:27,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:33:27,607 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:33:27,611 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:33:29,661 INFO  L?                        ?]: Removed 129 outVars from TransFormulas that were not future-live.
[2025-02-05 11:33:29,662 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:33:29,699 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:33:29,704 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:33:29,704 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29 BoogieIcfgContainer
[2025-02-05 11:33:29,704 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:33:29,708 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:33:29,709 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:33:29,716 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:33:29,721 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:26" (1/3) ...
[2025-02-05 11:33:29,721 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136dfcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:29, skipping insertion in model container
[2025-02-05 11:33:29,721 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:26" (2/3) ...
[2025-02-05 11:33:29,722 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136dfcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:29, skipping insertion in model container
[2025-02-05 11:33:29,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29" (3/3) ...
[2025-02-05 11:33:29,723 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem11_label38.c
[2025-02-05 11:33:29,758 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:33:29,761 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label38.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:33:29,892 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:33:29,918 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;@162ac4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:33:29,922 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:33:29,927 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:29,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2025-02-05 11:33:29,948 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:29,950 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]
[2025-02-05 11:33:29,950 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:29,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:29,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1353451309, now seen corresponding path program 1 times
[2025-02-05 11:33:29,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:29,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691074374]
[2025-02-05 11:33:29,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:29,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:30,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes.
[2025-02-05 11:33:30,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements.
[2025-02-05 11:33:30,253 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:30,253 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:30,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:30,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:30,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691074374]
[2025-02-05 11:33:30,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691074374] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:30,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:30,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:30,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140284036]
[2025-02-05 11:33:30,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:30,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:30,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:30,878 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:30,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:30,881 INFO  L87              Difference]: Start difference. First operand  has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:32,554 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:32,554 INFO  L93              Difference]: Finished difference Result 776 states and 1360 transitions.
[2025-02-05 11:33:32,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:32,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60
[2025-02-05 11:33:32,561 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:32,584 INFO  L225             Difference]: With dead ends: 776
[2025-02-05 11:33:32,584 INFO  L226             Difference]: Without dead ends: 413
[2025-02-05 11:33:32,592 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-02-05 11:33:32,600 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 167 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:32,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 11:33:32,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 413 states.
[2025-02-05 11:33:32,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411.
[2025-02-05 11:33:32,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:32,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions.
[2025-02-05 11:33:32,736 INFO  L78                 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 60
[2025-02-05 11:33:32,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:32,738 INFO  L471      AbstractCegarLoop]: Abstraction has 411 states and 598 transitions.
[2025-02-05 11:33:32,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:32,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions.
[2025-02-05 11:33:32,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-02-05 11:33:32,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:32,742 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:32,742 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:33:32,742 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:32,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:32,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -1414807486, now seen corresponding path program 1 times
[2025-02-05 11:33:32,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:32,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041591658]
[2025-02-05 11:33:32,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:32,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:32,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-02-05 11:33:32,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-02-05 11:33:32,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:32,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:33,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:33,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:33,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041591658]
[2025-02-05 11:33:33,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041591658] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:33,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:33,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:33,130 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333318395]
[2025-02-05 11:33:33,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:33,132 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:33,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:33,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:33,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:33,133 INFO  L87              Difference]: Start difference. First operand 411 states and 598 transitions. Second operand  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:34,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:34,223 INFO  L93              Difference]: Finished difference Result 1209 states and 1765 transitions.
[2025-02-05 11:33:34,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:34,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128
[2025-02-05 11:33:34,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:34,237 INFO  L225             Difference]: With dead ends: 1209
[2025-02-05 11:33:34,237 INFO  L226             Difference]: Without dead ends: 800
[2025-02-05 11:33:34,243 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-02-05 11:33:34,244 INFO  L435           NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:34,244 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 11:33:34,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2025-02-05 11:33:34,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787.
[2025-02-05 11:33:34,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:34,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions.
[2025-02-05 11:33:34,328 INFO  L78                 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 128
[2025-02-05 11:33:34,329 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:34,332 INFO  L471      AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions.
[2025-02-05 11:33:34,333 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:34,333 INFO  L276                IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions.
[2025-02-05 11:33:34,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-02-05 11:33:34,338 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:34,339 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:34,339 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:33:34,339 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:34,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:34,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -885533571, now seen corresponding path program 1 times
[2025-02-05 11:33:34,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:34,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743559239]
[2025-02-05 11:33:34,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:34,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:34,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-02-05 11:33:34,433 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-02-05 11:33:34,433 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:34,433 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:34,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:34,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:34,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743559239]
[2025-02-05 11:33:34,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743559239] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:34,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:34,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:34,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885065702]
[2025-02-05 11:33:34,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:34,764 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:34,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:34,765 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:34,766 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:34,766 INFO  L87              Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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-02-05 11:33:35,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:35,620 INFO  L93              Difference]: Finished difference Result 1941 states and 2628 transitions.
[2025-02-05 11:33:35,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:35,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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 130
[2025-02-05 11:33:35,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:35,629 INFO  L225             Difference]: With dead ends: 1941
[2025-02-05 11:33:35,629 INFO  L226             Difference]: Without dead ends: 1156
[2025-02-05 11:33:35,631 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-02-05 11:33:35,633 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:35,635 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:35,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1156 states.
[2025-02-05 11:33:35,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156.
[2025-02-05 11:33:35,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:35,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions.
[2025-02-05 11:33:35,667 INFO  L78                 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 130
[2025-02-05 11:33:35,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:35,667 INFO  L471      AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions.
[2025-02-05 11:33:35,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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-02-05 11:33:35,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions.
[2025-02-05 11:33:35,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-02-05 11:33:35,670 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:35,670 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:33:35,670 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:33:35,671 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:35,671 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:35,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -1476400118, now seen corresponding path program 1 times
[2025-02-05 11:33:35,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:35,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448725862]
[2025-02-05 11:33:35,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:35,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:35,718 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-02-05 11:33:35,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-02-05 11:33:35,745 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:35,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:36,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:36,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:36,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448725862]
[2025-02-05 11:33:36,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448725862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:36,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:36,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:36,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815241229]
[2025-02-05 11:33:36,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:36,097 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:36,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:36,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:36,097 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:36,098 INFO  L87              Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:36,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:36,999 INFO  L93              Difference]: Finished difference Result 2877 states and 3705 transitions.
[2025-02-05 11:33:36,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:37,000 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172
[2025-02-05 11:33:37,000 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:37,007 INFO  L225             Difference]: With dead ends: 2877
[2025-02-05 11:33:37,007 INFO  L226             Difference]: Without dead ends: 1723
[2025-02-05 11:33:37,009 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-02-05 11:33:37,009 INFO  L435           NwaCegarLoop]: 314 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:37,010 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 335 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:33:37,011 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1723 states.
[2025-02-05 11:33:37,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1529.
[2025-02-05 11:33:37,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1529 states, 1528 states have (on average 1.2604712041884816) internal successors, (1926), 1528 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:37,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1926 transitions.
[2025-02-05 11:33:37,042 INFO  L78                 Accepts]: Start accepts. Automaton has 1529 states and 1926 transitions. Word has length 172
[2025-02-05 11:33:37,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:37,042 INFO  L471      AbstractCegarLoop]: Abstraction has 1529 states and 1926 transitions.
[2025-02-05 11:33:37,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:37,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 1529 states and 1926 transitions.
[2025-02-05 11:33:37,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-02-05 11:33:37,046 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:37,046 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:37,046 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:33:37,047 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:37,047 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:37,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 145389466, now seen corresponding path program 1 times
[2025-02-05 11:33:37,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:37,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598541714]
[2025-02-05 11:33:37,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:37,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:37,079 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-02-05 11:33:37,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-02-05 11:33:37,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:37,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:37,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 184 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-02-05 11:33:37,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:37,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598541714]
[2025-02-05 11:33:37,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598541714] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:37,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:37,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:37,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651370528]
[2025-02-05 11:33:37,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:37,500 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:37,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:37,501 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:37,501 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:37,501 INFO  L87              Difference]: Start difference. First operand 1529 states and 1926 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:38,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:38,949 INFO  L93              Difference]: Finished difference Result 3616 states and 4598 transitions.
[2025-02-05 11:33:38,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:38,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242
[2025-02-05 11:33:38,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:38,965 INFO  L225             Difference]: With dead ends: 3616
[2025-02-05 11:33:38,968 INFO  L226             Difference]: Without dead ends: 2089
[2025-02-05 11:33:38,971 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-02-05 11:33:38,972 INFO  L435           NwaCegarLoop]: 366 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:38,973 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 11:33:38,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2089 states.
[2025-02-05 11:33:39,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1896.
[2025-02-05 11:33:39,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1896 states, 1895 states have (on average 1.2480211081794195) internal successors, (2365), 1895 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:39,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2365 transitions.
[2025-02-05 11:33:39,032 INFO  L78                 Accepts]: Start accepts. Automaton has 1896 states and 2365 transitions. Word has length 242
[2025-02-05 11:33:39,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:39,033 INFO  L471      AbstractCegarLoop]: Abstraction has 1896 states and 2365 transitions.
[2025-02-05 11:33:39,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:39,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 1896 states and 2365 transitions.
[2025-02-05 11:33:39,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-02-05 11:33:39,037 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:39,037 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:39,037 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:33:39,038 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:39,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:39,038 INFO  L85        PathProgramCache]: Analyzing trace with hash -1891222419, now seen corresponding path program 1 times
[2025-02-05 11:33:39,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:39,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051612270]
[2025-02-05 11:33:39,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:39,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:39,114 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-02-05 11:33:39,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-02-05 11:33:39,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:39,172 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:39,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 202 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-02-05 11:33:39,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:39,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051612270]
[2025-02-05 11:33:39,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051612270] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:39,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:39,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:33:39,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896475669]
[2025-02-05 11:33:39,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:39,636 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:39,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:39,637 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:39,637 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:39,637 INFO  L87              Difference]: Start difference. First operand 1896 states and 2365 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:40,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:40,477 INFO  L93              Difference]: Finished difference Result 4903 states and 6169 transitions.
[2025-02-05 11:33:40,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:40,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260
[2025-02-05 11:33:40,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:40,489 INFO  L225             Difference]: With dead ends: 4903
[2025-02-05 11:33:40,490 INFO  L226             Difference]: Without dead ends: 3009
[2025-02-05 11:33:40,493 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-02-05 11:33:40,494 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:40,495 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:40,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3009 states.
[2025-02-05 11:33:40,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3008.
[2025-02-05 11:33:40,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.2048553375457267) internal successors, (3623), 3007 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:40,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3623 transitions.
[2025-02-05 11:33:40,557 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 3623 transitions. Word has length 260
[2025-02-05 11:33:40,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:40,558 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 3623 transitions.
[2025-02-05 11:33:40,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:40,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 3623 transitions.
[2025-02-05 11:33:40,563 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2025-02-05 11:33:40,563 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:40,564 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:40,564 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:33:40,565 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:40,565 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:40,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 1024708405, now seen corresponding path program 1 times
[2025-02-05 11:33:40,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:40,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939983135]
[2025-02-05 11:33:40,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:40,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:40,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes.
[2025-02-05 11:33:40,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements.
[2025-02-05 11:33:40,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:40,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:40,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:33:40,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:40,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939983135]
[2025-02-05 11:33:40,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939983135] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:40,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:40,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:40,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936117304]
[2025-02-05 11:33:40,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:40,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:40,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:40,919 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:40,919 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:40,920 INFO  L87              Difference]: Start difference. First operand 3008 states and 3623 transitions. Second operand  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:41,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:41,799 INFO  L93              Difference]: Finished difference Result 7501 states and 9171 transitions.
[2025-02-05 11:33:41,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:41,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269
[2025-02-05 11:33:41,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:41,861 INFO  L225             Difference]: With dead ends: 7501
[2025-02-05 11:33:41,862 INFO  L226             Difference]: Without dead ends: 4495
[2025-02-05 11:33:41,865 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-02-05 11:33:41,866 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 116 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:41,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 180 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:41,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4495 states.
[2025-02-05 11:33:41,937 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4493.
[2025-02-05 11:33:41,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4493 states, 4492 states have (on average 1.2050311665182547) internal successors, (5413), 4492 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:41,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 5413 transitions.
[2025-02-05 11:33:41,959 INFO  L78                 Accepts]: Start accepts. Automaton has 4493 states and 5413 transitions. Word has length 269
[2025-02-05 11:33:41,959 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:41,959 INFO  L471      AbstractCegarLoop]: Abstraction has 4493 states and 5413 transitions.
[2025-02-05 11:33:41,959 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:41,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 4493 states and 5413 transitions.
[2025-02-05 11:33:41,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 280
[2025-02-05 11:33:41,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:41,967 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:41,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:33:41,967 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:41,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:41,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -1066144310, now seen corresponding path program 1 times
[2025-02-05 11:33:41,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:41,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094077921]
[2025-02-05 11:33:41,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:41,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:42,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes.
[2025-02-05 11:33:42,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements.
[2025-02-05 11:33:42,053 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:42,053 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:42,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-02-05 11:33:42,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:42,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094077921]
[2025-02-05 11:33:42,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094077921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:42,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:42,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:42,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530394709]
[2025-02-05 11:33:42,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:42,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:42,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:42,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:42,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:42,234 INFO  L87              Difference]: Start difference. First operand 4493 states and 5413 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-02-05 11:33:43,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:43,169 INFO  L93              Difference]: Finished difference Result 10273 states and 12522 transitions.
[2025-02-05 11:33:43,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:43,170 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 279
[2025-02-05 11:33:43,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:43,193 INFO  L225             Difference]: With dead ends: 10273
[2025-02-05 11:33:43,193 INFO  L226             Difference]: Without dead ends: 5782
[2025-02-05 11:33:43,200 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-02-05 11:33:43,200 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:43,200 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 158 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:33:43,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5782 states.
[2025-02-05 11:33:43,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 4481.
[2025-02-05 11:33:43,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4481 states, 4480 states have (on average 1.2044642857142858) internal successors, (5396), 4480 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:43,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 5396 transitions.
[2025-02-05 11:33:43,452 INFO  L78                 Accepts]: Start accepts. Automaton has 4481 states and 5396 transitions. Word has length 279
[2025-02-05 11:33:43,452 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:43,452 INFO  L471      AbstractCegarLoop]: Abstraction has 4481 states and 5396 transitions.
[2025-02-05 11:33:43,453 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-02-05 11:33:43,453 INFO  L276                IsEmpty]: Start isEmpty. Operand 4481 states and 5396 transitions.
[2025-02-05 11:33:43,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 280
[2025-02-05 11:33:43,470 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:43,470 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:33:43,470 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:33:43,470 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:43,471 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:43,471 INFO  L85        PathProgramCache]: Analyzing trace with hash -856810770, now seen corresponding path program 1 times
[2025-02-05 11:33:43,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:43,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129369833]
[2025-02-05 11:33:43,471 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:43,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:43,509 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes.
[2025-02-05 11:33:43,534 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements.
[2025-02-05 11:33:43,535 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:43,535 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:44,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-02-05 11:33:44,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:44,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129369833]
[2025-02-05 11:33:44,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129369833] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:33:44,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387272170]
[2025-02-05 11:33:44,320 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:44,320 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:33:44,320 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:33:44,323 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:33:44,326 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:33:44,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes.
[2025-02-05 11:33:44,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements.
[2025-02-05 11:33:44,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:44,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:44,464 INFO  L256         TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:33:44,476 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:33:45,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-02-05 11:33:45,124 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:33:54,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-02-05 11:33:54,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [387272170] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:33:54,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 11:33:54,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2025-02-05 11:33:54,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95501059]
[2025-02-05 11:33:54,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:54,286 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:33:54,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:54,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:33:54,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:33:54,286 INFO  L87              Difference]: Start difference. First operand 4481 states and 5396 transitions. Second operand  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:56,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:56,687 INFO  L93              Difference]: Finished difference Result 12838 states and 15806 transitions.
[2025-02-05 11:33:56,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:33:56,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 279
[2025-02-05 11:33:56,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:56,720 INFO  L225             Difference]: With dead ends: 12838
[2025-02-05 11:33:56,720 INFO  L226             Difference]: Without dead ends: 8359
[2025-02-05 11:33:56,728 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:33:56,729 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 275 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:56,729 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 138 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 11:33:56,739 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8359 states.
[2025-02-05 11:33:56,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8359 to 5953.
[2025-02-05 11:33:56,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5953 states, 5952 states have (on average 1.1851478494623655) internal successors, (7054), 5952 states have internal predecessors, (7054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:56,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5953 states to 5953 states and 7054 transitions.
[2025-02-05 11:33:56,916 INFO  L78                 Accepts]: Start accepts. Automaton has 5953 states and 7054 transitions. Word has length 279
[2025-02-05 11:33:56,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:56,917 INFO  L471      AbstractCegarLoop]: Abstraction has 5953 states and 7054 transitions.
[2025-02-05 11:33:56,917 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:56,917 INFO  L276                IsEmpty]: Start isEmpty. Operand 5953 states and 7054 transitions.
[2025-02-05 11:33:56,924 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2025-02-05 11:33:56,924 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:33:56,924 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:56,934 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 11:33:57,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:33:57,130 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:33:57,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:33:57,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 712060928, now seen corresponding path program 1 times
[2025-02-05 11:33:57,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:33:57,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470198926]
[2025-02-05 11:33:57,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:33:57,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:33:57,160 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes.
[2025-02-05 11:33:57,181 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements.
[2025-02-05 11:33:57,181 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:33:57,181 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:33:57,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 217 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2025-02-05 11:33:57,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:33:57,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470198926]
[2025-02-05 11:33:57,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470198926] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:33:57,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:33:57,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:33:57,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250127419]
[2025-02-05 11:33:57,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:33:57,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:33:57,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:33:57,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:33:57,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:33:57,301 INFO  L87              Difference]: Start difference. First operand 5953 states and 7054 transitions. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:58,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:33:58,186 INFO  L93              Difference]: Finished difference Result 13373 states and 15936 transitions.
[2025-02-05 11:33:58,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:33:58,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 290
[2025-02-05 11:33:58,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:33:58,188 INFO  L225             Difference]: With dead ends: 13373
[2025-02-05 11:33:58,188 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:33:58,208 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-02-05 11:33:58,212 INFO  L435           NwaCegarLoop]: 322 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:33:58,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 341 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:33:58,213 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:33:58,213 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:33:58,213 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-02-05 11:33:58,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:33:58,213 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290
[2025-02-05 11:33:58,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:33:58,213 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:33:58,213 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:33:58,213 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:33:58,214 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:33:58,219 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:33:58,220 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:33:58,223 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:33:58,226 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:33:58,306 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:33:58,321 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:33:58 BoogieIcfgContainer
[2025-02-05 11:33:58,323 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:33:58,324 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:33:58,324 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:33:58,324 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:33:58,325 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:29" (3/4) ...
[2025-02-05 11:33:58,327 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:33:58,357 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-02-05 11:33:58,358 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:33:58,359 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:33:58,360 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:33:58,661 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:33:58,661 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:33:58,661 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:33:58,664 INFO  L158              Benchmark]: Toolchain (without parser) took 32564.23ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 102.3MB in the beginning and 297.5MB in the end (delta: -195.1MB). Peak memory consumption was 294.8MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,664 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:33:58,664 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 831.79ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 58.7MB in the end (delta: 42.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,664 INFO  L158              Benchmark]: Boogie Procedure Inliner took 154.23ms. Allocated memory is still 142.6MB. Free memory was 58.7MB in the beginning and 41.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,669 INFO  L158              Benchmark]: Boogie Preprocessor took 262.73ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 79.4MB in the end (delta: -37.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,669 INFO  L158              Benchmark]: IcfgBuilder took 2342.58ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 33.0MB in the end (delta: 46.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,669 INFO  L158              Benchmark]: TraceAbstraction took 28614.72ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 32.1MB in the beginning and 310.0MB in the end (delta: -278.0MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,669 INFO  L158              Benchmark]: Witness Printer took 337.55ms. Allocated memory is still 629.1MB. Free memory was 310.0MB in the beginning and 297.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:33:58,673 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 831.79ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 58.7MB in the end (delta: 42.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 154.23ms. Allocated memory is still 142.6MB. Free memory was 58.7MB in the beginning and 41.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 262.73ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 79.4MB in the end (delta: -37.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2342.58ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 33.0MB in the end (delta: 46.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 28614.72ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 32.1MB in the beginning and 310.0MB in the end (delta: -278.0MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB.
 * Witness Printer took 337.55ms. Allocated memory is still 629.1MB. Free memory was 310.0MB in the beginning and 297.5MB 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: 196]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1526 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1526 mSDsluCounter, 2208 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 1064 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6135 IncrementalHoareTripleChecker+Invalid, 7199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1064 mSolverCounterUnsat, 1948 mSDtfsCounter, 6135 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5953occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 4112 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 2388 NumberOfCodeBlocks, 2388 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2655 ConstructedInterpolants, 0 QuantifiedInterpolants, 20340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1578/1808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 1044]: Location Invariant
    Derived location invariant: ((((((a25 == 12) || (138 < a23)) || (a25 < 11)) || (a25 == 11)) || (a4 != 1)) || (a29 < 246))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:33:58,711 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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