./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label13.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/Problem15_label13.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 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:49:36,263 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:49:36,325 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:49:36,332 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:49:36,332 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:49:36,353 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:49:36,353 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:49:36,353 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:49:36,354 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:49:36,354 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:49:36,355 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:49:36,355 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:49:36,355 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:49:36,355 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:49:36,355 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:49:36,355 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:49:36,355 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:49:36,355 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:49:36,356 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:49:36,356 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:49:36,356 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:49:36,357 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:49:36,357 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:49:36,357 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:49:36,357 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:49:36,357 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:49:36,357 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 -> 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b
[2025-03-03 10:49:36,580 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:49:36,586 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:49:36,588 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:49:36,589 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:49:36,590 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:49:36,591 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label13.c
[2025-03-03 10:49:37,721 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a855069/fe815348d1c3484995fe843f7e883ebe/FLAG3cc8e9e75
[2025-03-03 10:49:38,026 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:49:38,027 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label13.c
[2025-03-03 10:49:38,043 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a855069/fe815348d1c3484995fe843f7e883ebe/FLAG3cc8e9e75
[2025-03-03 10:49:38,286 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a855069/fe815348d1c3484995fe843f7e883ebe
[2025-03-03 10:49:38,288 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:49:38,289 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:49:38,290 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:49:38,290 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:49:38,294 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:49:38,295 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:38,295 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe9419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38, skipping insertion in model container
[2025-03-03 10:49:38,295 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:38,341 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:49:38,460 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/Problem15_label13.c[5940,5953]
[2025-03-03 10:49:38,686 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:49:38,693 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:49:38,706 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/Problem15_label13.c[5940,5953]
[2025-03-03 10:49:38,870 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:49:38,883 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:49:38,884 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38 WrapperNode
[2025-03-03 10:49:38,884 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:49:38,884 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:49:38,884 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:49:38,885 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:49:38,889 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:38,916 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,032 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-03-03 10:49:39,033 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:49:39,033 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:49:39,033 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:49:39,033 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:49:39,041 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,041 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,070 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,147 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 10:49:39,147 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,147 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,190 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,197 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,210 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,218 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,234 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:49:39,235 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:49:39,235 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:49:39,235 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:49:39,236 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (1/1) ...
[2025-03-03 10:49:39,240 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:49:39,268 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:49:39,280 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 10:49:39,284 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 10:49:39,301 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:49:39,301 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:49:39,301 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:49:39,301 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:49:39,344 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:49:39,345 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:49:41,232 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-03-03 10:49:41,287 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-03-03 10:49:41,287 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:49:41,305 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:49:41,305 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:49:41,305 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:41 BoogieIcfgContainer
[2025-03-03 10:49:41,305 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:49:41,308 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:49:41,308 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:49:41,312 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:49:41,312 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:49:38" (1/3) ...
[2025-03-03 10:49:41,313 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8399eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:41, skipping insertion in model container
[2025-03-03 10:49:41,313 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:38" (2/3) ...
[2025-03-03 10:49:41,314 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8399eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:41, skipping insertion in model container
[2025-03-03 10:49:41,314 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:41" (3/3) ...
[2025-03-03 10:49:41,315 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label13.c
[2025-03-03 10:49:41,327 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:49:41,328 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label13.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:49:41,383 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:49:41,392 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;@c452422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:49:41,393 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:49:41,397 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 10:49:41,401 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2025-03-03 10:49:41,401 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:41,402 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]
[2025-03-03 10:49:41,402 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:41,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:41,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 43944127, now seen corresponding path program 1 times
[2025-03-03 10:49:41,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:41,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169103406]
[2025-03-03 10:49:41,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:41,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:41,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-03-03 10:49:41,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-03-03 10:49:41,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:41,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:41,681 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 10:49:41,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:41,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169103406]
[2025-03-03 10:49:41,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169103406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:41,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:41,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:49:41,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78924366]
[2025-03-03 10:49:41,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:41,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:41,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:41,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:41,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:41,704 INFO  L87              Difference]: Start difference. First operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 10:49:43,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:43,275 INFO  L93              Difference]: Finished difference Result 1191 states and 2154 transitions.
[2025-03-03 10:49:43,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:43,277 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48
[2025-03-03 10:49:43,277 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:43,287 INFO  L225             Difference]: With dead ends: 1191
[2025-03-03 10:49:43,287 INFO  L226             Difference]: Without dead ends: 688
[2025-03-03 10:49:43,289 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 10:49:43,291 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 323 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:43,291 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 10:49:43,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 688 states.
[2025-03-03 10:49:43,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680.
[2025-03-03 10:49:43,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 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 10:49:43,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions.
[2025-03-03 10:49:43,343 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 48
[2025-03-03 10:49:43,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:43,343 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions.
[2025-03-03 10:49:43,344 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 10:49:43,344 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions.
[2025-03-03 10:49:43,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-03-03 10:49:43,347 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:43,347 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 10:49:43,347 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:49:43,347 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:43,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:43,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 1042319677, now seen corresponding path program 1 times
[2025-03-03 10:49:43,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:43,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796407880]
[2025-03-03 10:49:43,348 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:43,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:43,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-03 10:49:43,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-03 10:49:43,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:43,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:43,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:43,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:43,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796407880]
[2025-03-03 10:49:43,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796407880] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:43,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:43,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:49:43,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27031050]
[2025-03-03 10:49:43,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:43,562 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:43,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:43,563 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:43,563 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:43,563 INFO  L87              Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:49:44,652 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:44,652 INFO  L93              Difference]: Finished difference Result 1964 states and 3171 transitions.
[2025-03-03 10:49:44,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:44,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116
[2025-03-03 10:49:44,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:44,657 INFO  L225             Difference]: With dead ends: 1964
[2025-03-03 10:49:44,657 INFO  L226             Difference]: Without dead ends: 1286
[2025-03-03 10:49:44,658 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 10:49:44,658 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:44,658 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:49:44,660 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1286 states.
[2025-03-03 10:49:44,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281.
[2025-03-03 10:49:44,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 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 10:49:44,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions.
[2025-03-03 10:49:44,704 INFO  L78                 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 116
[2025-03-03 10:49:44,704 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:44,704 INFO  L471      AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions.
[2025-03-03 10:49:44,705 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:49:44,705 INFO  L276                IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions.
[2025-03-03 10:49:44,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-03-03 10:49:44,707 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:44,707 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:44,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:49:44,707 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:44,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:44,708 INFO  L85        PathProgramCache]: Analyzing trace with hash -1935919959, now seen corresponding path program 1 times
[2025-03-03 10:49:44,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:44,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972180450]
[2025-03-03 10:49:44,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:44,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:44,729 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-03 10:49:44,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-03 10:49:44,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:44,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:45,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:45,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:45,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972180450]
[2025-03-03 10:49:45,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972180450] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:45,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:45,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:49:45,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466058832]
[2025-03-03 10:49:45,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:45,013 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:45,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:45,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:45,014 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:45,015 INFO  L87              Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 10:49:46,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:46,080 INFO  L93              Difference]: Finished difference Result 2859 states and 3905 transitions.
[2025-03-03 10:49:46,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:46,082 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124
[2025-03-03 10:49:46,083 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:46,087 INFO  L225             Difference]: With dead ends: 2859
[2025-03-03 10:49:46,088 INFO  L226             Difference]: Without dead ends: 1580
[2025-03-03 10:49:46,091 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 10:49:46,093 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:46,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:49:46,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1580 states.
[2025-03-03 10:49:46,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580.
[2025-03-03 10:49:46,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 0 states have call successors, (0), 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 10:49:46,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions.
[2025-03-03 10:49:46,119 INFO  L78                 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 124
[2025-03-03 10:49:46,120 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:46,120 INFO  L471      AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions.
[2025-03-03 10:49:46,120 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 10:49:46,120 INFO  L276                IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions.
[2025-03-03 10:49:46,123 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 10:49:46,125 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:46,125 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:49:46,125 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:49:46,125 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:46,126 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:46,127 INFO  L85        PathProgramCache]: Analyzing trace with hash 246559620, now seen corresponding path program 1 times
[2025-03-03 10:49:46,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:46,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591150965]
[2025-03-03 10:49:46,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:46,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:46,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 10:49:46,185 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 10:49:46,185 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:46,185 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:46,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:46,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:46,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591150965]
[2025-03-03 10:49:46,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591150965] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:49:46,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453189265]
[2025-03-03 10:49:46,703 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:46,703 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:49:46,703 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:49:46,705 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 10:49:46,706 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 10:49:46,743 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 10:49:46,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 10:49:46,777 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:46,777 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:46,780 INFO  L256         TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 10:49:46,787 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:49:47,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 166 backedges. 142 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:47,341 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 10:49:47,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 166 backedges. 142 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:47,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453189265] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 10:49:47,819 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 10:49:47,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2025-03-03 10:49:47,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112065483]
[2025-03-03 10:49:47,819 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 10:49:47,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 10:49:47,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:47,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 10:49:47,821 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-03 10:49:47,821 INFO  L87              Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand  has 10 states, 10 states have (on average 52.7) internal successors, (527), 9 states have internal predecessors, (527), 0 states have call successors, (0), 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 10:49:52,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:52,898 INFO  L93              Difference]: Finished difference Result 8167 states and 11084 transitions.
[2025-03-03 10:49:52,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 10:49:52,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 52.7) internal successors, (527), 9 states have internal predecessors, (527), 0 states have call successors, (0), 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 215
[2025-03-03 10:49:52,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:52,910 INFO  L225             Difference]: With dead ends: 8167
[2025-03-03 10:49:52,910 INFO  L226             Difference]: Without dead ends: 4287
[2025-03-03 10:49:52,912 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2025-03-03 10:49:52,913 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 4276 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 6815 mSolverCounterSat, 1147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4276 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 7962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1147 IncrementalHoareTripleChecker+Valid, 6815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:52,914 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4276 Valid, 320 Invalid, 7962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1147 Valid, 6815 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time]
[2025-03-03 10:49:52,916 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4287 states.
[2025-03-03 10:49:52,953 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3978.
[2025-03-03 10:49:52,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3978 states, 3977 states have (on average 1.1508674880563239) internal successors, (4577), 3977 states have internal predecessors, (4577), 0 states have call successors, (0), 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 10:49:52,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 4577 transitions.
[2025-03-03 10:49:52,962 INFO  L78                 Accepts]: Start accepts. Automaton has 3978 states and 4577 transitions. Word has length 215
[2025-03-03 10:49:52,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:52,963 INFO  L471      AbstractCegarLoop]: Abstraction has 3978 states and 4577 transitions.
[2025-03-03 10:49:52,963 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 52.7) internal successors, (527), 9 states have internal predecessors, (527), 0 states have call successors, (0), 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 10:49:52,964 INFO  L276                IsEmpty]: Start isEmpty. Operand 3978 states and 4577 transitions.
[2025-03-03 10:49:52,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2025-03-03 10:49:52,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:52,966 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:52,972 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 10:49:53,166 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:49:53,167 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:53,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:53,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997382630, now seen corresponding path program 1 times
[2025-03-03 10:49:53,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:53,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560778911]
[2025-03-03 10:49:53,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:53,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:53,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes.
[2025-03-03 10:49:53,216 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements.
[2025-03-03 10:49:53,217 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:53,217 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:53,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-03-03 10:49:53,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:53,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560778911]
[2025-03-03 10:49:53,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560778911] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:53,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:53,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:49:53,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644116563]
[2025-03-03 10:49:53,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:53,433 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:53,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:53,434 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:53,434 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:53,434 INFO  L87              Difference]: Start difference. First operand 3978 states and 4577 transitions. Second operand  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 10:49:54,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:54,295 INFO  L93              Difference]: Finished difference Result 8858 states and 10345 transitions.
[2025-03-03 10:49:54,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:54,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 330
[2025-03-03 10:49:54,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:54,308 INFO  L225             Difference]: With dead ends: 8858
[2025-03-03 10:49:54,308 INFO  L226             Difference]: Without dead ends: 5181
[2025-03-03 10:49:54,312 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 10:49:54,313 INFO  L435           NwaCegarLoop]: 219 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:54,313 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 265 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:49:54,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5181 states.
[2025-03-03 10:49:54,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5178.
[2025-03-03 10:49:54,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5178 states, 5177 states have (on average 1.1323160131350203) internal successors, (5862), 5177 states have internal predecessors, (5862), 0 states have call successors, (0), 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 10:49:54,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 5862 transitions.
[2025-03-03 10:49:54,375 INFO  L78                 Accepts]: Start accepts. Automaton has 5178 states and 5862 transitions. Word has length 330
[2025-03-03 10:49:54,376 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:54,376 INFO  L471      AbstractCegarLoop]: Abstraction has 5178 states and 5862 transitions.
[2025-03-03 10:49:54,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 10:49:54,376 INFO  L276                IsEmpty]: Start isEmpty. Operand 5178 states and 5862 transitions.
[2025-03-03 10:49:54,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 395
[2025-03-03 10:49:54,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:54,379 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:49:54,381 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:49:54,381 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:54,382 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:54,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935665746, now seen corresponding path program 1 times
[2025-03-03 10:49:54,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:54,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295784794]
[2025-03-03 10:49:54,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:54,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:54,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes.
[2025-03-03 10:49:54,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements.
[2025-03-03 10:49:54,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:54,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:54,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-03 10:49:54,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:54,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295784794]
[2025-03-03 10:49:54,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295784794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:54,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:54,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:49:54,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521780832]
[2025-03-03 10:49:54,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:54,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:54,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:54,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:54,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:54,672 INFO  L87              Difference]: Start difference. First operand 5178 states and 5862 transitions. Second operand  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:49:55,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:55,546 INFO  L93              Difference]: Finished difference Result 11868 states and 13619 transitions.
[2025-03-03 10:49:55,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:55,548 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 394
[2025-03-03 10:49:55,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:55,563 INFO  L225             Difference]: With dead ends: 11868
[2025-03-03 10:49:55,563 INFO  L226             Difference]: Without dead ends: 6692
[2025-03-03 10:49:55,567 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 10:49:55,568 INFO  L435           NwaCegarLoop]: 458 mSDtfsCounter, 287 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:55,568 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 494 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:49:55,573 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6692 states.
[2025-03-03 10:49:55,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 6681.
[2025-03-03 10:49:55,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6681 states, 6680 states have (on average 1.123502994011976) internal successors, (7505), 6680 states have internal predecessors, (7505), 0 states have call successors, (0), 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 10:49:55,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 7505 transitions.
[2025-03-03 10:49:55,643 INFO  L78                 Accepts]: Start accepts. Automaton has 6681 states and 7505 transitions. Word has length 394
[2025-03-03 10:49:55,643 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:55,643 INFO  L471      AbstractCegarLoop]: Abstraction has 6681 states and 7505 transitions.
[2025-03-03 10:49:55,644 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:49:55,644 INFO  L276                IsEmpty]: Start isEmpty. Operand 6681 states and 7505 transitions.
[2025-03-03 10:49:55,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 396
[2025-03-03 10:49:55,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:55,650 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:49:55,651 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 10:49:55,651 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:55,651 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:55,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1032909180, now seen corresponding path program 1 times
[2025-03-03 10:49:55,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:55,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487782813]
[2025-03-03 10:49:55,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:55,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:55,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes.
[2025-03-03 10:49:55,695 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements.
[2025-03-03 10:49:55,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:55,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:55,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-03-03 10:49:55,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:55,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487782813]
[2025-03-03 10:49:55,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487782813] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:55,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:55,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:49:55,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922181610]
[2025-03-03 10:49:55,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:55,941 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:55,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:55,942 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:55,942 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:55,942 INFO  L87              Difference]: Start difference. First operand 6681 states and 7505 transitions. Second operand  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 10:49:56,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:56,757 INFO  L93              Difference]: Finished difference Result 14260 states and 16148 transitions.
[2025-03-03 10:49:56,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:56,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 395
[2025-03-03 10:49:56,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:56,775 INFO  L225             Difference]: With dead ends: 14260
[2025-03-03 10:49:56,775 INFO  L226             Difference]: Without dead ends: 7581
[2025-03-03 10:49:56,779 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 10:49:56,779 INFO  L435           NwaCegarLoop]: 240 mSDtfsCounter, 263 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:56,780 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 278 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:49:56,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7581 states.
[2025-03-03 10:49:56,842 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7578.
[2025-03-03 10:49:56,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7578 states, 7577 states have (on average 1.111125775372839) internal successors, (8419), 7577 states have internal predecessors, (8419), 0 states have call successors, (0), 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 10:49:56,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8419 transitions.
[2025-03-03 10:49:56,860 INFO  L78                 Accepts]: Start accepts. Automaton has 7578 states and 8419 transitions. Word has length 395
[2025-03-03 10:49:56,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:56,860 INFO  L471      AbstractCegarLoop]: Abstraction has 7578 states and 8419 transitions.
[2025-03-03 10:49:56,860 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 10:49:56,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 7578 states and 8419 transitions.
[2025-03-03 10:49:56,862 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 401
[2025-03-03 10:49:56,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:56,863 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:49:56,864 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 10:49:56,864 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:56,864 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:56,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 977154520, now seen corresponding path program 1 times
[2025-03-03 10:49:56,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:56,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529936911]
[2025-03-03 10:49:56,865 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:56,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:56,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes.
[2025-03-03 10:49:56,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements.
[2025-03-03 10:49:56,914 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:56,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:57,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:49:57,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:57,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529936911]
[2025-03-03 10:49:57,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529936911] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:57,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:57,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:49:57,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015187629]
[2025-03-03 10:49:57,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:57,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:57,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:57,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:57,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:57,075 INFO  L87              Difference]: Start difference. First operand 7578 states and 8419 transitions. Second operand  has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 10:49:57,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:57,822 INFO  L93              Difference]: Finished difference Result 18454 states and 20562 transitions.
[2025-03-03 10:49:57,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:57,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 400
[2025-03-03 10:49:57,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:57,840 INFO  L225             Difference]: With dead ends: 18454
[2025-03-03 10:49:57,840 INFO  L226             Difference]: Without dead ends: 10878
[2025-03-03 10:49:57,846 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 10:49:57,847 INFO  L435           NwaCegarLoop]: 528 mSDtfsCounter, 238 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:57,847 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 567 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:49:57,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10878 states.
[2025-03-03 10:49:57,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 10276.
[2025-03-03 10:49:57,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10276 states, 10275 states have (on average 1.0830170316301704) internal successors, (11128), 10275 states have internal predecessors, (11128), 0 states have call successors, (0), 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 10:49:57,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10276 states to 10276 states and 11128 transitions.
[2025-03-03 10:49:57,967 INFO  L78                 Accepts]: Start accepts. Automaton has 10276 states and 11128 transitions. Word has length 400
[2025-03-03 10:49:57,967 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:57,968 INFO  L471      AbstractCegarLoop]: Abstraction has 10276 states and 11128 transitions.
[2025-03-03 10:49:57,968 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 10:49:57,968 INFO  L276                IsEmpty]: Start isEmpty. Operand 10276 states and 11128 transitions.
[2025-03-03 10:49:57,970 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 426
[2025-03-03 10:49:57,970 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:57,970 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:49:57,970 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 10:49:57,971 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:57,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:57,971 INFO  L85        PathProgramCache]: Analyzing trace with hash -1428299866, now seen corresponding path program 1 times
[2025-03-03 10:49:57,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:57,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941366096]
[2025-03-03 10:49:57,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:57,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:58,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes.
[2025-03-03 10:49:58,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements.
[2025-03-03 10:49:58,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:58,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:58,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-03-03 10:49:58,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:58,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941366096]
[2025-03-03 10:49:58,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941366096] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:58,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:58,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:49:58,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43420639]
[2025-03-03 10:49:58,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:58,237 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:58,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:58,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:58,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:58,237 INFO  L87              Difference]: Start difference. First operand 10276 states and 11128 transitions. Second operand  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:49:58,947 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:49:58,948 INFO  L93              Difference]: Finished difference Result 23842 states and 26078 transitions.
[2025-03-03 10:49:58,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:49:58,951 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 425
[2025-03-03 10:49:58,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:49:58,970 INFO  L225             Difference]: With dead ends: 23842
[2025-03-03 10:49:58,970 INFO  L226             Difference]: Without dead ends: 13568
[2025-03-03 10:49:58,979 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 10:49:58,979 INFO  L435           NwaCegarLoop]: 501 mSDtfsCounter, 276 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:49:58,980 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 540 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:49:58,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13568 states.
[2025-03-03 10:49:59,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13568 to 13562.
[2025-03-03 10:49:59,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13562 states, 13561 states have (on average 1.0668092323574958) internal successors, (14467), 13561 states have internal predecessors, (14467), 0 states have call successors, (0), 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 10:49:59,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13562 states to 13562 states and 14467 transitions.
[2025-03-03 10:49:59,143 INFO  L78                 Accepts]: Start accepts. Automaton has 13562 states and 14467 transitions. Word has length 425
[2025-03-03 10:49:59,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:49:59,145 INFO  L471      AbstractCegarLoop]: Abstraction has 13562 states and 14467 transitions.
[2025-03-03 10:49:59,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:49:59,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 13562 states and 14467 transitions.
[2025-03-03 10:49:59,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 550
[2025-03-03 10:49:59,148 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:49:59,148 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:59,148 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:49:59,148 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:49:59,149 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:49:59,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 1653187118, now seen corresponding path program 1 times
[2025-03-03 10:49:59,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:49:59,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001129521]
[2025-03-03 10:49:59,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:49:59,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:49:59,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes.
[2025-03-03 10:49:59,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements.
[2025-03-03 10:49:59,204 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:49:59,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:49:59,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 471 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-03 10:49:59,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:49:59,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001129521]
[2025-03-03 10:49:59,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001129521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:49:59,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:49:59,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:49:59,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683571407]
[2025-03-03 10:49:59,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:49:59,343 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:49:59,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:49:59,343 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:49:59,343 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:49:59,343 INFO  L87              Difference]: Start difference. First operand 13562 states and 14467 transitions. Second operand  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 10:50:00,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:00,070 INFO  L93              Difference]: Finished difference Result 27120 states and 28942 transitions.
[2025-03-03 10:50:00,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:00,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 549
[2025-03-03 10:50:00,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:00,094 INFO  L225             Difference]: With dead ends: 27120
[2025-03-03 10:50:00,095 INFO  L226             Difference]: Without dead ends: 13859
[2025-03-03 10:50:00,101 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 10:50:00,101 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:00,102 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:50:00,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13859 states.
[2025-03-03 10:50:00,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13859 to 13560.
[2025-03-03 10:50:00,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13560 states, 13559 states have (on average 1.066671583450107) internal successors, (14463), 13559 states have internal predecessors, (14463), 0 states have call successors, (0), 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 10:50:00,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 14463 transitions.
[2025-03-03 10:50:00,206 INFO  L78                 Accepts]: Start accepts. Automaton has 13560 states and 14463 transitions. Word has length 549
[2025-03-03 10:50:00,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:00,206 INFO  L471      AbstractCegarLoop]: Abstraction has 13560 states and 14463 transitions.
[2025-03-03 10:50:00,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 10:50:00,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 13560 states and 14463 transitions.
[2025-03-03 10:50:00,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 576
[2025-03-03 10:50:00,211 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:00,211 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:00,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:50:00,211 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:00,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:00,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -1936140006, now seen corresponding path program 1 times
[2025-03-03 10:50:00,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:00,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468260762]
[2025-03-03 10:50:00,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:00,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:00,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes.
[2025-03-03 10:50:00,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements.
[2025-03-03 10:50:00,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:00,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:00,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2025-03-03 10:50:00,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:00,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468260762]
[2025-03-03 10:50:00,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468260762] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:00,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:00,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:50:00,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595791977]
[2025-03-03 10:50:00,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:00,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:50:00,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:00,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:50:00,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:50:00,507 INFO  L87              Difference]: Start difference. First operand 13560 states and 14463 transitions. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 10:50:01,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:01,263 INFO  L93              Difference]: Finished difference Result 29839 states and 31892 transitions.
[2025-03-03 10:50:01,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:01,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 575
[2025-03-03 10:50:01,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:01,279 INFO  L225             Difference]: With dead ends: 29839
[2025-03-03 10:50:01,280 INFO  L226             Difference]: Without dead ends: 16281
[2025-03-03 10:50:01,292 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 10:50:01,293 INFO  L435           NwaCegarLoop]: 205 mSDtfsCounter, 289 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:01,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 240 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:50:01,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16281 states.
[2025-03-03 10:50:01,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16281 to 14161.
[2025-03-03 10:50:01,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14161 states, 14160 states have (on average 1.0656779661016949) internal successors, (15090), 14160 states have internal predecessors, (15090), 0 states have call successors, (0), 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 10:50:01,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14161 states to 14161 states and 15090 transitions.
[2025-03-03 10:50:01,402 INFO  L78                 Accepts]: Start accepts. Automaton has 14161 states and 15090 transitions. Word has length 575
[2025-03-03 10:50:01,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:01,403 INFO  L471      AbstractCegarLoop]: Abstraction has 14161 states and 15090 transitions.
[2025-03-03 10:50:01,403 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 10:50:01,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 14161 states and 15090 transitions.
[2025-03-03 10:50:01,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 596
[2025-03-03 10:50:01,407 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:01,407 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:50:01,407 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:50:01,408 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:01,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:01,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -950155135, now seen corresponding path program 1 times
[2025-03-03 10:50:01,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:01,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247990854]
[2025-03-03 10:50:01,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:01,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:01,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes.
[2025-03-03 10:50:01,467 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements.
[2025-03-03 10:50:01,467 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:01,467 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:01,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 519 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked.
[2025-03-03 10:50:01,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:01,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247990854]
[2025-03-03 10:50:01,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247990854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:01,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:01,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:50:01,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746181335]
[2025-03-03 10:50:01,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:01,652 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:50:01,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:01,652 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:50:01,652 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:50:01,653 INFO  L87              Difference]: Start difference. First operand 14161 states and 15090 transitions. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 10:50:02,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:02,356 INFO  L93              Difference]: Finished difference Result 31608 states and 33811 transitions.
[2025-03-03 10:50:02,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:02,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 595
[2025-03-03 10:50:02,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:02,378 INFO  L225             Difference]: With dead ends: 31608
[2025-03-03 10:50:02,378 INFO  L226             Difference]: Without dead ends: 17748
[2025-03-03 10:50:02,388 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 10:50:02,389 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 364 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:02,389 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 420 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:50:02,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17748 states.
[2025-03-03 10:50:02,536 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 14459.
[2025-03-03 10:50:02,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14459 states, 14458 states have (on average 1.0704800110665376) internal successors, (15477), 14458 states have internal predecessors, (15477), 0 states have call successors, (0), 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 10:50:02,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14459 states to 14459 states and 15477 transitions.
[2025-03-03 10:50:02,565 INFO  L78                 Accepts]: Start accepts. Automaton has 14459 states and 15477 transitions. Word has length 595
[2025-03-03 10:50:02,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:02,566 INFO  L471      AbstractCegarLoop]: Abstraction has 14459 states and 15477 transitions.
[2025-03-03 10:50:02,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 10:50:02,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 14459 states and 15477 transitions.
[2025-03-03 10:50:02,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 617
[2025-03-03 10:50:02,574 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:02,574 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:02,574 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 10:50:02,574 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:02,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:02,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -1167762948, now seen corresponding path program 1 times
[2025-03-03 10:50:02,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:02,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605606444]
[2025-03-03 10:50:02,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:02,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:02,622 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes.
[2025-03-03 10:50:02,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements.
[2025-03-03 10:50:02,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:02,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:02,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 540 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-03-03 10:50:02,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:02,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605606444]
[2025-03-03 10:50:02,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605606444] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:02,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:02,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:50:02,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541498639]
[2025-03-03 10:50:02,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:02,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:50:02,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:02,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:50:02,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:50:02,918 INFO  L87              Difference]: Start difference. First operand 14459 states and 15477 transitions. Second operand  has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 10:50:03,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:03,680 INFO  L93              Difference]: Finished difference Result 32501 states and 35000 transitions.
[2025-03-03 10:50:03,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:03,681 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 616
[2025-03-03 10:50:03,681 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:03,697 INFO  L225             Difference]: With dead ends: 32501
[2025-03-03 10:50:03,697 INFO  L226             Difference]: Without dead ends: 18044
[2025-03-03 10:50:03,706 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 10:50:03,707 INFO  L435           NwaCegarLoop]: 140 mSDtfsCounter, 157 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:03,707 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 169 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:50:03,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18044 states.
[2025-03-03 10:50:03,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18044 to 15051.
[2025-03-03 10:50:03,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15051 states, 15050 states have (on average 1.0720265780730898) internal successors, (16134), 15050 states have internal predecessors, (16134), 0 states have call successors, (0), 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 10:50:03,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 16134 transitions.
[2025-03-03 10:50:03,827 INFO  L78                 Accepts]: Start accepts. Automaton has 15051 states and 16134 transitions. Word has length 616
[2025-03-03 10:50:03,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:03,827 INFO  L471      AbstractCegarLoop]: Abstraction has 15051 states and 16134 transitions.
[2025-03-03 10:50:03,827 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 10:50:03,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 15051 states and 16134 transitions.
[2025-03-03 10:50:03,833 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 674
[2025-03-03 10:50:03,834 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:03,834 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:03,834 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 10:50:03,834 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:03,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:03,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 2014616243, now seen corresponding path program 1 times
[2025-03-03 10:50:03,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:03,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671553896]
[2025-03-03 10:50:03,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:03,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:03,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes.
[2025-03-03 10:50:03,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements.
[2025-03-03 10:50:03,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:03,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:04,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 595 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked.
[2025-03-03 10:50:04,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:04,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671553896]
[2025-03-03 10:50:04,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671553896] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:04,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:04,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:50:04,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661810902]
[2025-03-03 10:50:04,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:04,134 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:50:04,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:04,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:50:04,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:04,135 INFO  L87              Difference]: Start difference. First operand 15051 states and 16134 transitions. Second operand  has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 10:50:05,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:05,184 INFO  L93              Difference]: Finished difference Result 36383 states and 39064 transitions.
[2025-03-03 10:50:05,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:50:05,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 673
[2025-03-03 10:50:05,184 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:05,201 INFO  L225             Difference]: With dead ends: 36383
[2025-03-03 10:50:05,201 INFO  L226             Difference]: Without dead ends: 21633
[2025-03-03 10:50:05,212 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:05,212 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 596 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:05,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 180 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:50:05,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21633 states.
[2025-03-03 10:50:05,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21633 to 17440.
[2025-03-03 10:50:05,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17440 states, 17439 states have (on average 1.0648546361603304) internal successors, (18570), 17439 states have internal predecessors, (18570), 0 states have call successors, (0), 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 10:50:05,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17440 states to 17440 states and 18570 transitions.
[2025-03-03 10:50:05,360 INFO  L78                 Accepts]: Start accepts. Automaton has 17440 states and 18570 transitions. Word has length 673
[2025-03-03 10:50:05,360 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:05,361 INFO  L471      AbstractCegarLoop]: Abstraction has 17440 states and 18570 transitions.
[2025-03-03 10:50:05,361 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 10:50:05,361 INFO  L276                IsEmpty]: Start isEmpty. Operand 17440 states and 18570 transitions.
[2025-03-03 10:50:05,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 675
[2025-03-03 10:50:05,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:05,367 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:50:05,367 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 10:50:05,367 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:05,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:05,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1214898405, now seen corresponding path program 1 times
[2025-03-03 10:50:05,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:05,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032232290]
[2025-03-03 10:50:05,368 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:05,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:05,406 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-03-03 10:50:05,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-03-03 10:50:05,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:05,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:06,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 801 backedges. 341 proven. 353 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2025-03-03 10:50:06,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:06,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032232290]
[2025-03-03 10:50:06,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032232290] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:50:06,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004916824]
[2025-03-03 10:50:06,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:06,083 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:06,083 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:50:06,085 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:50:06,086 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 10:50:06,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-03-03 10:50:06,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-03-03 10:50:06,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:06,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:06,275 INFO  L256         TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:50:06,287 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:50:06,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 801 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked.
[2025-03-03 10:50:06,365 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:50:06,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004916824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:06,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:50:06,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 10:50:06,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636353221]
[2025-03-03 10:50:06,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:06,368 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:50:06,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:06,368 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:50:06,368 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:50:06,368 INFO  L87              Difference]: Start difference. First operand 17440 states and 18570 transitions. Second operand  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 10:50:07,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:07,155 INFO  L93              Difference]: Finished difference Result 37269 states and 39870 transitions.
[2025-03-03 10:50:07,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:07,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 674
[2025-03-03 10:50:07,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:07,174 INFO  L225             Difference]: With dead ends: 37269
[2025-03-03 10:50:07,174 INFO  L226             Difference]: Without dead ends: 19831
[2025-03-03 10:50:07,186 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:50:07,187 INFO  L435           NwaCegarLoop]: 494 mSDtfsCounter, 263 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:07,187 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 532 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:50:07,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19831 states.
[2025-03-03 10:50:07,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19831 to 19531.
[2025-03-03 10:50:07,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19531 states, 19530 states have (on average 1.051510496671787) internal successors, (20536), 19530 states have internal predecessors, (20536), 0 states have call successors, (0), 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 10:50:07,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19531 states to 19531 states and 20536 transitions.
[2025-03-03 10:50:07,343 INFO  L78                 Accepts]: Start accepts. Automaton has 19531 states and 20536 transitions. Word has length 674
[2025-03-03 10:50:07,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:07,343 INFO  L471      AbstractCegarLoop]: Abstraction has 19531 states and 20536 transitions.
[2025-03-03 10:50:07,343 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 10:50:07,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 19531 states and 20536 transitions.
[2025-03-03 10:50:07,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 781
[2025-03-03 10:50:07,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:07,353 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:07,359 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 10:50:07,553 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-03 10:50:07,554 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:07,554 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:07,555 INFO  L85        PathProgramCache]: Analyzing trace with hash -1005106989, now seen corresponding path program 1 times
[2025-03-03 10:50:07,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:07,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383024965]
[2025-03-03 10:50:07,555 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:07,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:07,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes.
[2025-03-03 10:50:07,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements.
[2025-03-03 10:50:07,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:07,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:08,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 989 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked.
[2025-03-03 10:50:08,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:08,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383024965]
[2025-03-03 10:50:08,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383024965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:08,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:08,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:50:08,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402318800]
[2025-03-03 10:50:08,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:08,328 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:50:08,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:08,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:50:08,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:08,328 INFO  L87              Difference]: Start difference. First operand 19531 states and 20536 transitions. Second operand  has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 10:50:09,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:09,188 INFO  L93              Difference]: Finished difference Result 39420 states and 41454 transitions.
[2025-03-03 10:50:09,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 10:50:09,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 780
[2025-03-03 10:50:09,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:09,208 INFO  L225             Difference]: With dead ends: 39420
[2025-03-03 10:50:09,208 INFO  L226             Difference]: Without dead ends: 20190
[2025-03-03 10:50:09,218 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:50:09,218 INFO  L435           NwaCegarLoop]: 466 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:09,218 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 533 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:50:09,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20190 states.
[2025-03-03 10:50:09,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20190 to 19830.
[2025-03-03 10:50:09,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19830 states, 19829 states have (on average 1.0510867920722176) internal successors, (20842), 19829 states have internal predecessors, (20842), 0 states have call successors, (0), 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 10:50:09,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19830 states to 19830 states and 20842 transitions.
[2025-03-03 10:50:09,368 INFO  L78                 Accepts]: Start accepts. Automaton has 19830 states and 20842 transitions. Word has length 780
[2025-03-03 10:50:09,369 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:09,369 INFO  L471      AbstractCegarLoop]: Abstraction has 19830 states and 20842 transitions.
[2025-03-03 10:50:09,369 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 10:50:09,369 INFO  L276                IsEmpty]: Start isEmpty. Operand 19830 states and 20842 transitions.
[2025-03-03 10:50:09,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 787
[2025-03-03 10:50:09,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:09,379 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:09,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 10:50:09,379 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:09,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:09,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 386232769, now seen corresponding path program 1 times
[2025-03-03 10:50:09,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:09,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390156973]
[2025-03-03 10:50:09,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:09,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:09,427 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes.
[2025-03-03 10:50:09,467 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements.
[2025-03-03 10:50:09,467 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:09,467 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:09,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 1032 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked.
[2025-03-03 10:50:09,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:09,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390156973]
[2025-03-03 10:50:09,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390156973] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:09,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:09,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:50:09,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509532413]
[2025-03-03 10:50:09,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:09,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:50:09,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:09,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:50:09,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:09,990 INFO  L87              Difference]: Start difference. First operand 19830 states and 20842 transitions. Second operand  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 10:50:11,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:11,179 INFO  L93              Difference]: Finished difference Result 47484 states and 50103 transitions.
[2025-03-03 10:50:11,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:50:11,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 786
[2025-03-03 10:50:11,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:11,215 INFO  L225             Difference]: With dead ends: 47484
[2025-03-03 10:50:11,215 INFO  L226             Difference]: Without dead ends: 27656
[2025-03-03 10:50:11,229 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:11,229 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 449 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:11,230 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 132 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:50:11,247 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27656 states.
[2025-03-03 10:50:11,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27656 to 23429.
[2025-03-03 10:50:11,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23429 states, 23428 states have (on average 1.056129417790678) internal successors, (24743), 23428 states have internal predecessors, (24743), 0 states have call successors, (0), 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 10:50:11,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23429 states to 23429 states and 24743 transitions.
[2025-03-03 10:50:11,443 INFO  L78                 Accepts]: Start accepts. Automaton has 23429 states and 24743 transitions. Word has length 786
[2025-03-03 10:50:11,444 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:11,444 INFO  L471      AbstractCegarLoop]: Abstraction has 23429 states and 24743 transitions.
[2025-03-03 10:50:11,444 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 10:50:11,444 INFO  L276                IsEmpty]: Start isEmpty. Operand 23429 states and 24743 transitions.
[2025-03-03 10:50:11,461 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 925
[2025-03-03 10:50:11,461 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:11,462 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:11,462 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 10:50:11,462 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:11,462 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:11,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -1109812687, now seen corresponding path program 1 times
[2025-03-03 10:50:11,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:11,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33965459]
[2025-03-03 10:50:11,463 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:11,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:11,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes.
[2025-03-03 10:50:11,545 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements.
[2025-03-03 10:50:11,545 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:11,545 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:12,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 1592 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 10:50:12,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:12,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33965459]
[2025-03-03 10:50:12,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33965459] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:12,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:50:12,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:50:12,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705232204]
[2025-03-03 10:50:12,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:12,015 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:50:12,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:12,016 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:50:12,016 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:12,016 INFO  L87              Difference]: Start difference. First operand 23429 states and 24743 transitions. Second operand  has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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 10:50:13,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:13,168 INFO  L93              Difference]: Finished difference Result 51348 states and 54126 transitions.
[2025-03-03 10:50:13,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:50:13,169 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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 924
[2025-03-03 10:50:13,169 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:13,197 INFO  L225             Difference]: With dead ends: 51348
[2025-03-03 10:50:13,198 INFO  L226             Difference]: Without dead ends: 28220
[2025-03-03 10:50:13,214 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:50:13,215 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 455 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:13,215 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 172 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:50:13,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28220 states.
[2025-03-03 10:50:13,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28220 to 23728.
[2025-03-03 10:50:13,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23728 states, 23727 states have (on average 1.055632823365786) internal successors, (25047), 23727 states have internal predecessors, (25047), 0 states have call successors, (0), 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 10:50:13,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23728 states to 23728 states and 25047 transitions.
[2025-03-03 10:50:13,408 INFO  L78                 Accepts]: Start accepts. Automaton has 23728 states and 25047 transitions. Word has length 924
[2025-03-03 10:50:13,409 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:13,409 INFO  L471      AbstractCegarLoop]: Abstraction has 23728 states and 25047 transitions.
[2025-03-03 10:50:13,409 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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 10:50:13,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 23728 states and 25047 transitions.
[2025-03-03 10:50:13,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1004
[2025-03-03 10:50:13,427 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:13,427 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:13,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 10:50:13,428 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:13,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:13,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 1364696492, now seen corresponding path program 1 times
[2025-03-03 10:50:13,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:13,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652797214]
[2025-03-03 10:50:13,428 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:13,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:13,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1003 statements into 1 equivalence classes.
[2025-03-03 10:50:13,518 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1003 of 1003 statements.
[2025-03-03 10:50:13,518 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:13,518 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:14,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1762 backedges. 1152 proven. 457 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2025-03-03 10:50:14,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:14,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652797214]
[2025-03-03 10:50:14,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652797214] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:50:14,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131017465]
[2025-03-03 10:50:14,497 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:14,497 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:14,497 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:50:14,499 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:50:14,501 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 10:50:14,581 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1003 statements into 1 equivalence classes.
[2025-03-03 10:50:14,698 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1003 of 1003 statements.
[2025-03-03 10:50:14,698 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:14,698 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:14,702 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:50:14,709 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:50:14,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 1762 backedges. 1334 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked.
[2025-03-03 10:50:14,901 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:50:14,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131017465] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:14,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:50:14,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 10:50:14,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648787010]
[2025-03-03 10:50:14,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:14,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:50:14,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:14,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:50:14,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:50:14,903 INFO  L87              Difference]: Start difference. First operand 23728 states and 25047 transitions. Second operand  has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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 10:50:15,526 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:15,526 INFO  L93              Difference]: Finished difference Result 46853 states and 49448 transitions.
[2025-03-03 10:50:15,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:50:15,526 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1003
[2025-03-03 10:50:15,527 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:15,546 INFO  L225             Difference]: With dead ends: 46853
[2025-03-03 10:50:15,546 INFO  L226             Difference]: Without dead ends: 23426
[2025-03-03 10:50:15,561 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:50:15,561 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 127 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:15,561 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 467 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:50:15,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23426 states.
[2025-03-03 10:50:15,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 23426.
[2025-03-03 10:50:15,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23426 states, 23425 states have (on average 1.0384631803628601) internal successors, (24326), 23425 states have internal predecessors, (24326), 0 states have call successors, (0), 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 10:50:15,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 24326 transitions.
[2025-03-03 10:50:15,726 INFO  L78                 Accepts]: Start accepts. Automaton has 23426 states and 24326 transitions. Word has length 1003
[2025-03-03 10:50:15,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:15,727 INFO  L471      AbstractCegarLoop]: Abstraction has 23426 states and 24326 transitions.
[2025-03-03 10:50:15,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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 10:50:15,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 23426 states and 24326 transitions.
[2025-03-03 10:50:15,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1033
[2025-03-03 10:50:15,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:15,744 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:15,750 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 10:50:15,944 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:15,944 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:15,945 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:15,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 888096571, now seen corresponding path program 1 times
[2025-03-03 10:50:15,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:15,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872810942]
[2025-03-03 10:50:15,945 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:15,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:16,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes.
[2025-03-03 10:50:16,036 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements.
[2025-03-03 10:50:16,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:16,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:17,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 1671 backedges. 1150 proven. 187 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-03 10:50:17,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:17,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872810942]
[2025-03-03 10:50:17,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872810942] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:50:17,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188342417]
[2025-03-03 10:50:17,602 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:17,602 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:17,602 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:50:17,604 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:50:17,606 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 10:50:17,688 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes.
[2025-03-03 10:50:17,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements.
[2025-03-03 10:50:17,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:17,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:17,806 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 10:50:17,814 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:50:18,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked.
[2025-03-03 10:50:18,055 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 10:50:18,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked.
[2025-03-03 10:50:18,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [188342417] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 10:50:18,324 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 10:50:18,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12
[2025-03-03 10:50:18,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576283284]
[2025-03-03 10:50:18,325 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 10:50:18,326 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-03 10:50:18,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:18,327 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-03 10:50:18,327 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2025-03-03 10:50:18,327 INFO  L87              Difference]: Start difference. First operand 23426 states and 24326 transitions. Second operand  has 12 states, 12 states have (on average 109.08333333333333) internal successors, (1309), 12 states have internal predecessors, (1309), 0 states have call successors, (0), 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 10:50:30,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:30,320 INFO  L93              Difference]: Finished difference Result 71569 states and 74303 transitions.
[2025-03-03 10:50:30,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. 
[2025-03-03 10:50:30,321 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 109.08333333333333) internal successors, (1309), 12 states have internal predecessors, (1309), 0 states have call successors, (0), 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 1032
[2025-03-03 10:50:30,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:30,360 INFO  L225             Difference]: With dead ends: 71569
[2025-03-03 10:50:30,360 INFO  L226             Difference]: Without dead ends: 48444
[2025-03-03 10:50:30,369 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2154 GetRequests, 2090 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=905, Invalid=3385, Unknown=0, NotChecked=0, Total=4290
[2025-03-03 10:50:30,369 INFO  L435           NwaCegarLoop]: 102 mSDtfsCounter, 8659 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 24220 mSolverCounterSat, 1495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8659 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 25715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1495 IncrementalHoareTripleChecker+Valid, 24220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:30,369 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8659 Valid, 499 Invalid, 25715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1495 Valid, 24220 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time]
[2025-03-03 10:50:30,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48444 states.
[2025-03-03 10:50:30,582 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48444 to 23715.
[2025-03-03 10:50:30,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23715 states, 23714 states have (on average 1.0380366028506367) internal successors, (24616), 23714 states have internal predecessors, (24616), 0 states have call successors, (0), 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 10:50:30,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23715 states to 23715 states and 24616 transitions.
[2025-03-03 10:50:30,615 INFO  L78                 Accepts]: Start accepts. Automaton has 23715 states and 24616 transitions. Word has length 1032
[2025-03-03 10:50:30,615 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:30,615 INFO  L471      AbstractCegarLoop]: Abstraction has 23715 states and 24616 transitions.
[2025-03-03 10:50:30,615 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 109.08333333333333) internal successors, (1309), 12 states have internal predecessors, (1309), 0 states have call successors, (0), 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 10:50:30,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 23715 states and 24616 transitions.
[2025-03-03 10:50:30,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1068
[2025-03-03 10:50:30,714 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:50:30,714 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:50:30,724 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 10:50:30,915 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:30,915 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:50:30,916 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:50:30,916 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962993736, now seen corresponding path program 1 times
[2025-03-03 10:50:30,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:50:30,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351812773]
[2025-03-03 10:50:30,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:30,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:50:30,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes.
[2025-03-03 10:50:31,049 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements.
[2025-03-03 10:50:31,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:31,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:32,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 2210 backedges. 1484 proven. 336 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked.
[2025-03-03 10:50:32,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:50:32,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351812773]
[2025-03-03 10:50:32,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351812773] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:50:32,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952636151]
[2025-03-03 10:50:32,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:50:32,626 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:32,627 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:50:32,628 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 10:50:32,629 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 10:50:32,758 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes.
[2025-03-03 10:50:32,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements.
[2025-03-03 10:50:32,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:50:32,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:50:32,949 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:50:32,968 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:50:33,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 2210 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked.
[2025-03-03 10:50:33,286 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:50:33,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [952636151] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:50:33,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:50:33,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-03-03 10:50:33,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027281938]
[2025-03-03 10:50:33,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:50:33,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:50:33,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:50:33,288 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:50:33,288 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:50:33,288 INFO  L87              Difference]: Start difference. First operand 23715 states and 24616 transitions. Second operand  has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 10:50:34,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:50:34,452 INFO  L93              Difference]: Finished difference Result 54045 states and 56131 transitions.
[2025-03-03 10:50:34,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:50:34,452 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 1067
[2025-03-03 10:50:34,453 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:50:34,453 INFO  L225             Difference]: With dead ends: 54045
[2025-03-03 10:50:34,453 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 10:50:34,469 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1071 GetRequests, 1067 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:50:34,470 INFO  L435           NwaCegarLoop]: 53 mSDtfsCounter, 456 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:50:34,470 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 101 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:50:34,470 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 10:50:34,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 10:50:34,470 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 10:50:34,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 10:50:34,471 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1067
[2025-03-03 10:50:34,471 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:50:34,471 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 10:50:34,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 10:50:34,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 10:50:34,471 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 10:50:34,473 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 10:50:34,481 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 10:50:34,678 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:50:34,680 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:50:34,682 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 10:50:41,015 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 10:50:41,033 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:50:41 BoogieIcfgContainer
[2025-03-03 10:50:41,037 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 10:50:41,038 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 10:50:41,038 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 10:50:41,038 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 10:50:41,039 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:41" (3/4) ...
[2025-03-03 10:50:41,040 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 10:50:41,064 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-03-03 10:50:41,066 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 10:50:41,067 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 10:50:41,069 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 10:50:41,204 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 10:50:41,205 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 10:50:41,205 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 10:50:41,205 INFO  L158              Benchmark]: Toolchain (without parser) took 62916.09ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 100.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 324.6MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,205 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 10:50:41,206 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 594.05ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 88.5MB in the end (delta: 11.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,207 INFO  L158              Benchmark]: Boogie Procedure Inliner took 148.46ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 51.4MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,208 INFO  L158              Benchmark]: Boogie Preprocessor took 200.65ms. Allocated memory is still 142.6MB. Free memory was 51.4MB in the beginning and 46.2MB in the end (delta: 5.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,208 INFO  L158              Benchmark]: IcfgBuilder took 2070.35ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.2MB in the beginning and 232.5MB in the end (delta: -186.3MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,208 INFO  L158              Benchmark]: TraceAbstraction took 59729.84ms. Allocated memory was 369.1MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 232.5MB in the beginning and 1.1GB in the end (delta: -916.1MB). Peak memory consumption was 959.3MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,208 INFO  L158              Benchmark]: Witness Printer took 166.47ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 10:50:41,209 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 594.05ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 88.5MB in the end (delta: 11.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 148.46ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 51.4MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 200.65ms. Allocated memory is still 142.6MB. Free memory was 51.4MB in the beginning and 46.2MB in the end (delta: 5.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2070.35ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.2MB in the beginning and 232.5MB in the end (delta: -186.3MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 59729.84ms. Allocated memory was 369.1MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 232.5MB in the beginning and 1.1GB in the end (delta: -916.1MB). Peak memory consumption was 959.3MB. Max. memory is 16.1GB.
 * Witness Printer took 166.47ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 161]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.3s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18737 SdHoareTripleChecker+Valid, 31.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18737 mSDsluCounter, 6927 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1391 mSDsCounter, 5342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49468 IncrementalHoareTripleChecker+Invalid, 54810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5342 mSolverCounterUnsat, 5536 mSDtfsCounter, 49468 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5399 GetRequests, 5289 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23728occurred in iteration=18, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 47949 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 15712 NumberOfCodeBlocks, 15712 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 16931 ConstructedInterpolants, 0 QuantifiedInterpolants, 50923 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4738 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 28 InterpolantComputations, 19 PerfectInterpolantSequences, 20569/22117 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: 1776]: Location Invariant
    Derived location invariant: (((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 599998 + a29))) && (4 <= a2)) || (((((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (0 <= ((long long) 142 + a29)))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (((long long) a0 + 61) <= 0))) || (((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (4 <= a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 != 4)) && (4 <= a2))) || (((((0 <= ((long long) 143 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) a29 + 18) <= 0)) && (4 <= a2)) && (0 <= ((long long) 142 + a29)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) 142 + a29))) && (3 == a2)) && (a29 <= 43))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (0 <= ((long long) 142 + a29))) && (a29 <= 401234))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 146 + a0))) && (4 <= a2))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 599998 + a29)))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (((long long) a29 + 16) <= 0)) && (0 <= ((long long) 142 + a29)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (3 == a2))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) 599998 + a29))) && (((long long) a29 + 127) <= 0))) || ((((((long long) 42 + a4) <= 0) && (3 == a2)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 10:50:41,223 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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