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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a8fad34c1b6bf866cbe15b5ea976119cea35289eea577e5c8022c9572a9ef52
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:48:55,504 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:48:55,562 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:48:55,568 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:48:55,568 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:48:55,593 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:48:55,595 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:48:55,595 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:48:55,595 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:48:55,595 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:48:55,596 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:48:55,596 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:48:55,596 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:48:55,596 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:48:55,597 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:48:55,597 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:48:55,597 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:48:55,597 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:48:55,597 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:48:55,597 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:48:55,598 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:48:55,598 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:48:55,599 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:48:55,599 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:48:55,600 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:48:55,600 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:48:55,600 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:48:55,600 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a8fad34c1b6bf866cbe15b5ea976119cea35289eea577e5c8022c9572a9ef52
[2025-03-03 09:48:55,839 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:48:55,844 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:48:55,846 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:48:55,846 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:48:55,847 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:48:55,847 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label12.c
[2025-03-03 09:48:57,000 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b65eb95/a7a09c172cff4bafa44fcb8f84258761/FLAG698d0b189
[2025-03-03 09:48:57,303 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:48:57,304 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label12.c
[2025-03-03 09:48:57,312 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b65eb95/a7a09c172cff4bafa44fcb8f84258761/FLAG698d0b189
[2025-03-03 09:48:57,577 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b65eb95/a7a09c172cff4bafa44fcb8f84258761
[2025-03-03 09:48:57,579 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:48:57,580 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:48:57,581 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:48:57,581 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:48:57,584 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:48:57,585 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:57,585 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61459e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57, skipping insertion in model container
[2025-03-03 09:48:57,586 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:57,611 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:48:57,831 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label12.c[18829,18842]
[2025-03-03 09:48:57,870 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:48:57,881 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:48:57,949 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label12.c[18829,18842]
[2025-03-03 09:48:57,959 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:48:57,972 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:48:57,973 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57 WrapperNode
[2025-03-03 09:48:57,974 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:48:57,974 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:48:57,975 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:48:57,975 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:48:57,979 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:57,992 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,037 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666
[2025-03-03 09:48:58,037 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:48:58,038 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:48:58,038 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:48:58,038 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:48:58,048 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,048 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,051 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,075 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 09:48:58,076 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,077 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,095 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,097 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,106 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,107 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,112 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:48:58,113 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:48:58,113 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:48:58,113 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:48:58,113 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (1/1) ...
[2025-03-03 09:48:58,117 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:48:58,126 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:48:58,138 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:48:58,145 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:48:58,160 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:48:58,160 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:48:58,161 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:48:58,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:48:58,216 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:48:58,219 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:48:58,953 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-03 09:48:58,953 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:48:58,967 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:48:58,967 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:48:58,967 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:58 BoogieIcfgContainer
[2025-03-03 09:48:58,967 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:48:58,971 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:48:58,971 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:48:58,975 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:48:58,975 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:48:57" (1/3) ...
[2025-03-03 09:48:58,975 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124dadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:58, skipping insertion in model container
[2025-03-03 09:48:58,975 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:57" (2/3) ...
[2025-03-03 09:48:58,976 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124dadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:58, skipping insertion in model container
[2025-03-03 09:48:58,976 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:58" (3/3) ...
[2025-03-03 09:48:58,976 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem02_label12.c
[2025-03-03 09:48:58,987 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:48:58,989 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label12.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:48:59,041 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:48:59,048 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;@3aa5180f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:48:59,050 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:48:59,053 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:48:59,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-03 09:48:59,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:48:59,061 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:48:59,061 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:48:59,065 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:48:59,065 INFO  L85        PathProgramCache]: Analyzing trace with hash 994021459, now seen corresponding path program 1 times
[2025-03-03 09:48:59,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:48:59,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292247092]
[2025-03-03 09:48:59,071 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:48:59,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:48:59,132 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-03 09:48:59,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-03 09:48:59,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:48:59,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:48:59,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:48:59,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:48:59,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292247092]
[2025-03-03 09:48:59,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292247092] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:48:59,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:48:59,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:48:59,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388679805]
[2025-03-03 09:48:59,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:48:59,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:48:59,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:48:59,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:48:59,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:48:59,543 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 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 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:00,114 INFO  L93              Difference]: Finished difference Result 600 states and 1034 transitions.
[2025-03-03 09:49:00,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:00,118 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118
[2025-03-03 09:49:00,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:00,126 INFO  L225             Difference]: With dead ends: 600
[2025-03-03 09:49:00,126 INFO  L226             Difference]: Without dead ends: 309
[2025-03-03 09:49:00,130 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:00,134 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 48 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:00,134 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:49:00,148 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2025-03-03 09:49:00,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307.
[2025-03-03 09:49:00,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions.
[2025-03-03 09:49:00,180 INFO  L78                 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 118
[2025-03-03 09:49:00,181 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:00,181 INFO  L471      AbstractCegarLoop]: Abstraction has 307 states and 407 transitions.
[2025-03-03 09:49:00,181 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,181 INFO  L276                IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions.
[2025-03-03 09:49:00,184 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-03 09:49:00,184 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:00,184 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:00,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:49:00,185 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:00,185 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:00,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -1185368688, now seen corresponding path program 1 times
[2025-03-03 09:49:00,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:00,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784431724]
[2025-03-03 09:49:00,186 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:00,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:00,203 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-03 09:49:00,222 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-03 09:49:00,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:00,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:00,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:00,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:00,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784431724]
[2025-03-03 09:49:00,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784431724] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:00,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:00,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:00,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448625310]
[2025-03-03 09:49:00,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:00,388 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:00,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:00,388 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:00,388 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:00,388 INFO  L87              Difference]: Start difference. First operand 307 states and 407 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,777 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:00,777 INFO  L93              Difference]: Finished difference Result 758 states and 1034 transitions.
[2025-03-03 09:49:00,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:00,779 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123
[2025-03-03 09:49:00,779 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:00,781 INFO  L225             Difference]: With dead ends: 758
[2025-03-03 09:49:00,781 INFO  L226             Difference]: Without dead ends: 453
[2025-03-03 09:49:00,782 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:00,782 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 46 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:00,782 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 250 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:49:00,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 453 states.
[2025-03-03 09:49:00,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453.
[2025-03-03 09:49:00,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions.
[2025-03-03 09:49:00,799 INFO  L78                 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 123
[2025-03-03 09:49:00,799 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:00,799 INFO  L471      AbstractCegarLoop]: Abstraction has 453 states and 578 transitions.
[2025-03-03 09:49:00,799 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:00,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions.
[2025-03-03 09:49:00,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-03 09:49:00,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:00,802 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:00,802 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:49:00,802 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:00,803 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:00,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -2059622753, now seen corresponding path program 1 times
[2025-03-03 09:49:00,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:00,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172785000]
[2025-03-03 09:49:00,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:00,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:00,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 09:49:00,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 09:49:00,847 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:00,847 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:00,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:00,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:00,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172785000]
[2025-03-03 09:49:00,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172785000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:00,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:00,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:49:00,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095149359]
[2025-03-03 09:49:00,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:00,909 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:00,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:00,910 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:00,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:00,910 INFO  L87              Difference]: Start difference. First operand 453 states and 578 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,266 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:01,267 INFO  L93              Difference]: Finished difference Result 1325 states and 1691 transitions.
[2025-03-03 09:49:01,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:01,267 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135
[2025-03-03 09:49:01,267 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:01,270 INFO  L225             Difference]: With dead ends: 1325
[2025-03-03 09:49:01,270 INFO  L226             Difference]: Without dead ends: 874
[2025-03-03 09:49:01,270 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:01,271 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:01,271 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 82 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:01,272 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 874 states.
[2025-03-03 09:49:01,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874.
[2025-03-03 09:49:01,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 874 states, 873 states have (on average 1.2290950744558993) internal successors, (1073), 873 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1073 transitions.
[2025-03-03 09:49:01,300 INFO  L78                 Accepts]: Start accepts. Automaton has 874 states and 1073 transitions. Word has length 135
[2025-03-03 09:49:01,301 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:01,301 INFO  L471      AbstractCegarLoop]: Abstraction has 874 states and 1073 transitions.
[2025-03-03 09:49:01,301 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 874 states and 1073 transitions.
[2025-03-03 09:49:01,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-03-03 09:49:01,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:01,308 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:01,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:49:01,308 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:01,309 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:01,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -607609002, now seen corresponding path program 1 times
[2025-03-03 09:49:01,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:01,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549115197]
[2025-03-03 09:49:01,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:01,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:01,332 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-03-03 09:49:01,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-03-03 09:49:01,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:01,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:01,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:49:01,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:01,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549115197]
[2025-03-03 09:49:01,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549115197] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:01,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:01,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:01,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444622541]
[2025-03-03 09:49:01,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:01,427 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:01,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:01,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:01,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:01,427 INFO  L87              Difference]: Start difference. First operand 874 states and 1073 transitions. Second operand  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:01,762 INFO  L93              Difference]: Finished difference Result 2028 states and 2468 transitions.
[2025-03-03 09:49:01,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:01,762 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 164
[2025-03-03 09:49:01,762 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:01,765 INFO  L225             Difference]: With dead ends: 2028
[2025-03-03 09:49:01,765 INFO  L226             Difference]: Without dead ends: 1014
[2025-03-03 09:49:01,767 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:01,767 INFO  L435           NwaCegarLoop]: 58 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:01,767 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 65 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:01,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1014 states.
[2025-03-03 09:49:01,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012.
[2025-03-03 09:49:01,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1012 states, 1011 states have (on average 1.142433234421365) internal successors, (1155), 1011 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1155 transitions.
[2025-03-03 09:49:01,793 INFO  L78                 Accepts]: Start accepts. Automaton has 1012 states and 1155 transitions. Word has length 164
[2025-03-03 09:49:01,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:01,793 INFO  L471      AbstractCegarLoop]: Abstraction has 1012 states and 1155 transitions.
[2025-03-03 09:49:01,794 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:01,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 1012 states and 1155 transitions.
[2025-03-03 09:49:01,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-03 09:49:01,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:01,797 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:01,797 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:49:01,797 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:01,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:01,797 INFO  L85        PathProgramCache]: Analyzing trace with hash -2082587424, now seen corresponding path program 1 times
[2025-03-03 09:49:01,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:01,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581464869]
[2025-03-03 09:49:01,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:01,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:01,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-03 09:49:01,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-03 09:49:01,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:01,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:02,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:49:02,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:02,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581464869]
[2025-03-03 09:49:02,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581464869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:02,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:02,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:49:02,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10974233]
[2025-03-03 09:49:02,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:02,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:49:02,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:02,074 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:49:02,074 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:49:02,074 INFO  L87              Difference]: Start difference. First operand 1012 states and 1155 transitions. Second operand  has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:02,708 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:02,709 INFO  L93              Difference]: Finished difference Result 2582 states and 2922 transitions.
[2025-03-03 09:49:02,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:49:02,709 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 168
[2025-03-03 09:49:02,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:02,713 INFO  L225             Difference]: With dead ends: 2582
[2025-03-03 09:49:02,713 INFO  L226             Difference]: Without dead ends: 1572
[2025-03-03 09:49:02,714 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:02,715 INFO  L435           NwaCegarLoop]: 79 mSDtfsCounter, 327 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:02,715 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:49:02,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1572 states.
[2025-03-03 09:49:02,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1432.
[2025-03-03 09:49:02,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1432 states, 1431 states have (on average 1.116701607267645) internal successors, (1598), 1431 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:02,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1598 transitions.
[2025-03-03 09:49:02,736 INFO  L78                 Accepts]: Start accepts. Automaton has 1432 states and 1598 transitions. Word has length 168
[2025-03-03 09:49:02,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:02,737 INFO  L471      AbstractCegarLoop]: Abstraction has 1432 states and 1598 transitions.
[2025-03-03 09:49:02,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:02,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 1432 states and 1598 transitions.
[2025-03-03 09:49:02,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 191
[2025-03-03 09:49:02,740 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:02,740 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:02,740 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:49:02,740 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:02,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:02,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 417131531, now seen corresponding path program 1 times
[2025-03-03 09:49:02,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:02,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776155472]
[2025-03-03 09:49:02,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:02,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:02,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes.
[2025-03-03 09:49:02,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements.
[2025-03-03 09:49:02,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:02,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:02,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:02,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:02,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776155472]
[2025-03-03 09:49:02,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776155472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:02,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:49:02,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:49:02,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366248282]
[2025-03-03 09:49:02,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:02,848 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:02,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:02,848 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:02,848 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:02,848 INFO  L87              Difference]: Start difference. First operand 1432 states and 1598 transitions. Second operand  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:03,154 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:03,155 INFO  L93              Difference]: Finished difference Result 3700 states and 4160 transitions.
[2025-03-03 09:49:03,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:03,155 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190
[2025-03-03 09:49:03,155 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:03,161 INFO  L225             Difference]: With dead ends: 3700
[2025-03-03 09:49:03,161 INFO  L226             Difference]: Without dead ends: 2270
[2025-03-03 09:49:03,162 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:49:03,163 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 139 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:03,163 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 66 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:03,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2270 states.
[2025-03-03 09:49:03,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1710.
[2025-03-03 09:49:03,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1710 states, 1709 states have (on average 1.1222937390286718) internal successors, (1918), 1709 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:03,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1918 transitions.
[2025-03-03 09:49:03,196 INFO  L78                 Accepts]: Start accepts. Automaton has 1710 states and 1918 transitions. Word has length 190
[2025-03-03 09:49:03,197 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:03,197 INFO  L471      AbstractCegarLoop]: Abstraction has 1710 states and 1918 transitions.
[2025-03-03 09:49:03,197 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:03,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 1710 states and 1918 transitions.
[2025-03-03 09:49:03,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-03 09:49:03,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:49:03,200 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:03,200 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:49:03,200 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:49:03,200 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:49:03,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -1995502916, now seen corresponding path program 1 times
[2025-03-03 09:49:03,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:49:03,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045115632]
[2025-03-03 09:49:03,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:03,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:49:03,220 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-03 09:49:03,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-03 09:49:03,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:03,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:03,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:49:03,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:49:03,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045115632]
[2025-03-03 09:49:03,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045115632] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:49:03,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468429126]
[2025-03-03 09:49:03,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:49:03,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:03,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:49:03,525 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:49:03,527 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:49:03,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-03 09:49:03,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-03 09:49:03,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:49:03,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:49:03,616 INFO  L256         TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:49:03,624 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:49:03,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-03-03 09:49:03,801 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:49:03,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [468429126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:49:03,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:49:03,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:49:03,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009975216]
[2025-03-03 09:49:03,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:49:03,802 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:49:03,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:49:03,802 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:49:03,802 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:03,802 INFO  L87              Difference]: Start difference. First operand 1710 states and 1918 transitions. Second operand  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:04,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:49:04,142 INFO  L93              Difference]: Finished difference Result 3694 states and 4162 transitions.
[2025-03-03 09:49:04,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:49:04,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216
[2025-03-03 09:49:04,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:49:04,143 INFO  L225             Difference]: With dead ends: 3694
[2025-03-03 09:49:04,143 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:49:04,146 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:49:04,146 INFO  L435           NwaCegarLoop]: 184 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:49:04,148 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 194 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:49:04,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:49:04,149 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:49:04,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:04,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:49:04,149 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216
[2025-03-03 09:49:04,149 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:49:04,149 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:49:04,149 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:49:04,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:49:04,150 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:49:04,152 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:49:04,159 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:49:04,353 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:49:04,356 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:49:04,357 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:49:04,436 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:49:04,449 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:49:04 BoogieIcfgContainer
[2025-03-03 09:49:04,449 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:49:04,450 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:49:04,450 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:49:04,450 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:49:04,451 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:58" (3/4) ...
[2025-03-03 09:49:04,452 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:49:04,468 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-03 09:49:04,468 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:49:04,469 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:49:04,469 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:49:04,562 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:49:04,563 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:49:04,563 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:49:04,564 INFO  L158              Benchmark]: Toolchain (without parser) took 6984.36ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 120.4MB in the beginning and 83.2MB in the end (delta: 37.2MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,565 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:04,565 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 393.47ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 94.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,565 INFO  L158              Benchmark]: Boogie Procedure Inliner took 62.73ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 89.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,566 INFO  L158              Benchmark]: Boogie Preprocessor took 74.47ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 85.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:49:04,566 INFO  L158              Benchmark]: IcfgBuilder took 854.75ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 90.9MB in the end (delta: -5.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,566 INFO  L158              Benchmark]: TraceAbstraction took 5478.99ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.0MB in the beginning and 95.6MB in the end (delta: -5.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,567 INFO  L158              Benchmark]: Witness Printer took 113.25ms. Allocated memory is still 201.3MB. Free memory was 95.6MB in the beginning and 83.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:49:04,568 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.14ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 393.47ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 94.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 62.73ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 89.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 74.47ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 85.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 854.75ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 90.9MB in the end (delta: -5.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5478.99ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.0MB in the beginning and 95.6MB in the end (delta: -5.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB.
 * Witness Printer took 113.25ms. Allocated memory is still 201.3MB. Free memory was 95.6MB in the beginning and 83.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. 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: 536]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 981 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3125 IncrementalHoareTripleChecker+Invalid, 3674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 825 mSDtfsCounter, 3125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1710occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 704 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1330 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 4572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 339 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 454/512 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: 616]: Location Invariant
    Derived location invariant: ((((((10 <= a28) && (a19 == 1)) || ((9 <= a28) && (a28 <= 10))) || (a28 < 8)) || (((a17 == 8) && (a21 == 1)) && (a19 == 1))) || (a11 != 1))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:49:04,583 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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