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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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_label31.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 c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 02:01:02,973 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 02:01:03,020 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 02:01:03,024 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 02:01:03,024 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 02:01:03,051 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 02:01:03,053 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 02:01:03,053 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 02:01:03,053 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 02:01:03,054 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 02:01:03,054 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 02:01:03,055 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 02:01:03,055 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 02:01:03,055 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 02:01:03,055 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 02:01:03,056 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 02:01:03,056 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 02:01:03,057 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 02:01:03,057 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:01:03,058 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 02:01:03,058 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 02:01:03,059 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 02:01:03,059 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 02:01:03,059 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 02:01:03,059 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 -> c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba
[2025-03-08 02:01:03,261 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 02:01:03,267 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 02:01:03,269 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 02:01:03,270 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 02:01:03,270 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 02:01:03,271 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label31.c
[2025-03-08 02:01:04,418 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2c22a9/deb1f417f06b4d1cbe06cd02de9cf607/FLAG9e4ce3ea1
[2025-03-08 02:01:04,871 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 02:01:04,871 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c
[2025-03-08 02:01:04,887 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2c22a9/deb1f417f06b4d1cbe06cd02de9cf607/FLAG9e4ce3ea1
[2025-03-08 02:01:04,900 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2c22a9/deb1f417f06b4d1cbe06cd02de9cf607
[2025-03-08 02:01:04,902 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 02:01:04,903 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 02:01:04,904 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 02:01:04,904 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 02:01:04,907 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 02:01:04,908 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:01:04" (1/1) ...
[2025-03-08 02:01:04,909 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26418009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:04, skipping insertion in model container
[2025-03-08 02:01:04,909 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:01:04" (1/1) ...
[2025-03-08 02:01:04,948 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 02:01:05,115 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_label31.c[7892,7905]
[2025-03-08 02:01:05,357 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:01:05,368 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 02:01:05,388 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_label31.c[7892,7905]
[2025-03-08 02:01:05,522 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:01:05,536 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 02:01:05,537 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05 WrapperNode
[2025-03-08 02:01:05,537 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 02:01:05,539 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 02:01:05,539 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 02:01:05,539 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 02:01:05,544 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,564 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,692 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-03-08 02:01:05,692 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 02:01:05,693 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 02:01:05,693 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 02:01:05,693 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 02:01:05,700 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,700 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,721 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,815 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-08 02:01:05,815 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,815 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,854 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,861 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,872 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,880 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,922 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 02:01:05,924 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 02:01:05,924 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 02:01:05,924 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 02:01:05,925 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (1/1) ...
[2025-03-08 02:01:05,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:01:05,938 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:05,950 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-08 02:01:05,955 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-08 02:01:05,969 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 02:01:05,970 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 02:01:05,970 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 02:01:05,970 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 02:01:06,013 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 02:01:06,015 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 02:01:07,858 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-03-08 02:01:07,926 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-03-08 02:01:07,927 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 02:01:07,951 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 02:01:07,952 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 02:01:07,952 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:07 BoogieIcfgContainer
[2025-03-08 02:01:07,953 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 02:01:07,954 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 02:01:07,954 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 02:01:07,957 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 02:01:07,958 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:01:04" (1/3) ...
[2025-03-08 02:01:07,958 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e39a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:07, skipping insertion in model container
[2025-03-08 02:01:07,959 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:05" (2/3) ...
[2025-03-08 02:01:07,959 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e39a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:07, skipping insertion in model container
[2025-03-08 02:01:07,959 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:07" (3/3) ...
[2025-03-08 02:01:07,960 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label31.c
[2025-03-08 02:01:07,972 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 02:01:07,973 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label31.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 02:01:08,029 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 02:01:08,039 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;@496dee5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 02:01:08,039 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 02:01:08,043 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-08 02:01:08,047 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-03-08 02:01:08,048 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:08,048 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:08,049 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:08,051 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:08,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1545819425, now seen corresponding path program 1 times
[2025-03-08 02:01:08,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:08,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982340502]
[2025-03-08 02:01:08,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:08,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:08,107 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-03-08 02:01:08,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-03-08 02:01:08,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:08,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:08,389 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-08 02:01:08,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:08,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982340502]
[2025-03-08 02:01:08,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982340502] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:08,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:08,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:08,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89964786]
[2025-03-08 02:01:08,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:08,395 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:08,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:08,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:08,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:08,415 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 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-08 02:01:09,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:09,909 INFO  L93              Difference]: Finished difference Result 1155 states and 2103 transitions.
[2025-03-08 02:01:09,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:09,911 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2025-03-08 02:01:09,911 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:09,923 INFO  L225             Difference]: With dead ends: 1155
[2025-03-08 02:01:09,923 INFO  L226             Difference]: Without dead ends: 667
[2025-03-08 02:01:09,930 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-08 02:01:09,932 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 279 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:09,932 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:01:09,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 667 states.
[2025-03-08 02:01:09,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665.
[2025-03-08 02:01:09,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 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-08 02:01:09,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions.
[2025-03-08 02:01:09,990 INFO  L78                 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 65
[2025-03-08 02:01:09,990 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:09,990 INFO  L471      AbstractCegarLoop]: Abstraction has 665 states and 982 transitions.
[2025-03-08 02:01:09,991 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-08 02:01:09,991 INFO  L276                IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions.
[2025-03-08 02:01:09,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-03-08 02:01:09,996 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:09,996 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:09,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 02:01:09,997 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:09,997 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:09,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 1389783800, now seen corresponding path program 1 times
[2025-03-08 02:01:09,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:09,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596036422]
[2025-03-08 02:01:09,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:09,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:10,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-03-08 02:01:10,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-03-08 02:01:10,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:10,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:10,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:01:10,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:10,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596036422]
[2025-03-08 02:01:10,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596036422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:10,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:10,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:10,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140982289]
[2025-03-08 02:01:10,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:10,214 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:10,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:10,214 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:10,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:10,215 INFO  L87              Difference]: Start difference. First operand 665 states and 982 transitions. Second operand  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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-08 02:01:11,549 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:11,549 INFO  L93              Difference]: Finished difference Result 1953 states and 2893 transitions.
[2025-03-08 02:01:11,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:11,550 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140
[2025-03-08 02:01:11,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:11,554 INFO  L225             Difference]: With dead ends: 1953
[2025-03-08 02:01:11,555 INFO  L226             Difference]: Without dead ends: 1290
[2025-03-08 02:01:11,555 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-08 02:01:11,556 INFO  L435           NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:11,556 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 02:01:11,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1290 states.
[2025-03-08 02:01:11,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282.
[2025-03-08 02:01:11,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 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-08 02:01:11,583 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions.
[2025-03-08 02:01:11,583 INFO  L78                 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 140
[2025-03-08 02:01:11,585 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:11,585 INFO  L471      AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions.
[2025-03-08 02:01:11,585 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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-08 02:01:11,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions.
[2025-03-08 02:01:11,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-08 02:01:11,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:11,590 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:11,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 02:01:11,590 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:11,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:11,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -1936014014, now seen corresponding path program 1 times
[2025-03-08 02:01:11,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:11,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444572192]
[2025-03-08 02:01:11,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:11,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:11,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-08 02:01:11,628 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-08 02:01:11,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:11,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:11,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:01:11,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:11,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444572192]
[2025-03-08 02:01:11,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444572192] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:11,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:11,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:11,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023395667]
[2025-03-08 02:01:11,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:11,751 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:11,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:11,752 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:11,752 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:11,752 INFO  L87              Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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-08 02:01:12,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:12,977 INFO  L93              Difference]: Finished difference Result 3766 states and 5264 transitions.
[2025-03-08 02:01:12,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:12,977 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 144
[2025-03-08 02:01:12,978 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:12,985 INFO  L225             Difference]: With dead ends: 3766
[2025-03-08 02:01:12,985 INFO  L226             Difference]: Without dead ends: 2486
[2025-03-08 02:01:12,987 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-08 02:01:12,987 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:12,988 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:01:12,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2486 states.
[2025-03-08 02:01:13,015 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182.
[2025-03-08 02:01:13,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2182 states, 2181 states have (on average 1.2824392480513527) internal successors, (2797), 2181 states have internal predecessors, (2797), 0 states have call successors, (0), 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-08 02:01:13,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2797 transitions.
[2025-03-08 02:01:13,024 INFO  L78                 Accepts]: Start accepts. Automaton has 2182 states and 2797 transitions. Word has length 144
[2025-03-08 02:01:13,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:13,025 INFO  L471      AbstractCegarLoop]: Abstraction has 2182 states and 2797 transitions.
[2025-03-08 02:01:13,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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-08 02:01:13,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 2182 states and 2797 transitions.
[2025-03-08 02:01:13,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2025-03-08 02:01:13,027 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:13,027 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:13,027 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 02:01:13,027 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:13,028 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:13,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -1325130807, now seen corresponding path program 1 times
[2025-03-08 02:01:13,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:13,028 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989243729]
[2025-03-08 02:01:13,028 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:13,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:13,061 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-03-08 02:01:13,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-03-08 02:01:13,089 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:13,089 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:13,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:01:13,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:13,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989243729]
[2025-03-08 02:01:13,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989243729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:13,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:13,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:13,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977849346]
[2025-03-08 02:01:13,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:13,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:13,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:13,647 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:13,648 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:13,648 INFO  L87              Difference]: Start difference. First operand 2182 states and 2797 transitions. Second operand  has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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-08 02:01:14,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:14,903 INFO  L93              Difference]: Finished difference Result 4661 states and 5903 transitions.
[2025-03-08 02:01:14,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:14,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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 261
[2025-03-08 02:01:14,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:14,912 INFO  L225             Difference]: With dead ends: 4661
[2025-03-08 02:01:14,912 INFO  L226             Difference]: Without dead ends: 2481
[2025-03-08 02:01:14,915 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-08 02:01:14,917 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:14,918 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:01:14,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2481 states.
[2025-03-08 02:01:14,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481.
[2025-03-08 02:01:14,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2481 states, 2480 states have (on average 1.2508064516129032) internal successors, (3102), 2480 states have internal predecessors, (3102), 0 states have call successors, (0), 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-08 02:01:14,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3102 transitions.
[2025-03-08 02:01:14,983 INFO  L78                 Accepts]: Start accepts. Automaton has 2481 states and 3102 transitions. Word has length 261
[2025-03-08 02:01:14,984 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:14,985 INFO  L471      AbstractCegarLoop]: Abstraction has 2481 states and 3102 transitions.
[2025-03-08 02:01:14,985 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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-08 02:01:14,985 INFO  L276                IsEmpty]: Start isEmpty. Operand 2481 states and 3102 transitions.
[2025-03-08 02:01:14,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-03-08 02:01:14,989 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:14,990 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:14,990 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 02:01:14,990 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:14,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:14,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 234057141, now seen corresponding path program 1 times
[2025-03-08 02:01:14,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:14,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815502599]
[2025-03-08 02:01:14,993 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:14,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:15,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-03-08 02:01:15,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-03-08 02:01:15,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:15,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:15,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:01:15,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:15,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815502599]
[2025-03-08 02:01:15,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815502599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:15,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:15,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:15,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739818715]
[2025-03-08 02:01:15,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:15,302 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:15,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:15,303 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:15,303 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:15,303 INFO  L87              Difference]: Start difference. First operand 2481 states and 3102 transitions. Second operand  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-08 02:01:16,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:16,524 INFO  L93              Difference]: Finished difference Result 5872 states and 7585 transitions.
[2025-03-08 02:01:16,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:16,525 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 335
[2025-03-08 02:01:16,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:16,536 INFO  L225             Difference]: With dead ends: 5872
[2025-03-08 02:01:16,536 INFO  L226             Difference]: Without dead ends: 3692
[2025-03-08 02:01:16,538 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-08 02:01:16,539 INFO  L435           NwaCegarLoop]: 625 mSDtfsCounter, 255 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:16,539 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 664 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:01:16,542 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3692 states.
[2025-03-08 02:01:16,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3390.
[2025-03-08 02:01:16,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3390 states, 3389 states have (on average 1.2198288580702272) internal successors, (4134), 3389 states have internal predecessors, (4134), 0 states have call successors, (0), 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-08 02:01:16,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4134 transitions.
[2025-03-08 02:01:16,586 INFO  L78                 Accepts]: Start accepts. Automaton has 3390 states and 4134 transitions. Word has length 335
[2025-03-08 02:01:16,586 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:16,586 INFO  L471      AbstractCegarLoop]: Abstraction has 3390 states and 4134 transitions.
[2025-03-08 02:01:16,586 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-08 02:01:16,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 3390 states and 4134 transitions.
[2025-03-08 02:01:16,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-03-08 02:01:16,591 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:16,592 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:16,592 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 02:01:16,592 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:16,592 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:16,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -406655409, now seen corresponding path program 1 times
[2025-03-08 02:01:16,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:16,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520677180]
[2025-03-08 02:01:16,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:16,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:16,622 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-03-08 02:01:16,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-03-08 02:01:16,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:16,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:16,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-03-08 02:01:16,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:16,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520677180]
[2025-03-08 02:01:16,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520677180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:16,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:16,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:16,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954908267]
[2025-03-08 02:01:16,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:16,815 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:16,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:16,815 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:16,816 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:16,816 INFO  L87              Difference]: Start difference. First operand 3390 states and 4134 transitions. Second operand  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-08 02:01:18,286 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:18,286 INFO  L93              Difference]: Finished difference Result 7677 states and 9634 transitions.
[2025-03-08 02:01:18,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:18,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 352
[2025-03-08 02:01:18,287 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:18,296 INFO  L225             Difference]: With dead ends: 7677
[2025-03-08 02:01:18,296 INFO  L226             Difference]: Without dead ends: 4588
[2025-03-08 02:01:18,299 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-08 02:01:18,299 INFO  L435           NwaCegarLoop]: 580 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:18,299 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 02:01:18,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4588 states.
[2025-03-08 02:01:18,336 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4584.
[2025-03-08 02:01:18,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4584 states, 4583 states have (on average 1.1880864062840935) internal successors, (5445), 4583 states have internal predecessors, (5445), 0 states have call successors, (0), 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-08 02:01:18,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5445 transitions.
[2025-03-08 02:01:18,348 INFO  L78                 Accepts]: Start accepts. Automaton has 4584 states and 5445 transitions. Word has length 352
[2025-03-08 02:01:18,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:18,348 INFO  L471      AbstractCegarLoop]: Abstraction has 4584 states and 5445 transitions.
[2025-03-08 02:01:18,349 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-08 02:01:18,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 4584 states and 5445 transitions.
[2025-03-08 02:01:18,355 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 517
[2025-03-08 02:01:18,355 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:18,355 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:01:18,355 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 02:01:18,355 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:18,356 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:18,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -964329726, now seen corresponding path program 1 times
[2025-03-08 02:01:18,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:18,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037249612]
[2025-03-08 02:01:18,357 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:18,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:18,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes.
[2025-03-08 02:01:18,424 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements.
[2025-03-08 02:01:18,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:18,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:18,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 532 backedges. 430 proven. 39 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-03-08 02:01:18,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:18,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037249612]
[2025-03-08 02:01:18,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037249612] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:01:18,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541807761]
[2025-03-08 02:01:18,953 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:18,953 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:18,953 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:18,955 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-08 02:01:18,957 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-08 02:01:19,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes.
[2025-03-08 02:01:19,123 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements.
[2025-03-08 02:01:19,123 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:19,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:19,126 INFO  L256         TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:01:19,139 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:01:19,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 532 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2025-03-08 02:01:19,425 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:01:19,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541807761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:19,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:01:19,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 02:01:19,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915553293]
[2025-03-08 02:01:19,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:19,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:19,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:19,426 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:19,426 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:19,430 INFO  L87              Difference]: Start difference. First operand 4584 states and 5445 transitions. Second operand  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-08 02:01:20,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:20,399 INFO  L93              Difference]: Finished difference Result 11558 states and 13811 transitions.
[2025-03-08 02:01:20,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:20,400 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 516
[2025-03-08 02:01:20,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:20,415 INFO  L225             Difference]: With dead ends: 11558
[2025-03-08 02:01:20,415 INFO  L226             Difference]: Without dead ends: 7275
[2025-03-08 02:01:20,419 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:20,420 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:20,420 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:01:20,425 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7275 states.
[2025-03-08 02:01:20,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6378.
[2025-03-08 02:01:20,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6378 states, 6377 states have (on average 1.164340599027756) internal successors, (7425), 6377 states have internal predecessors, (7425), 0 states have call successors, (0), 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-08 02:01:20,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6378 states to 6378 states and 7425 transitions.
[2025-03-08 02:01:20,490 INFO  L78                 Accepts]: Start accepts. Automaton has 6378 states and 7425 transitions. Word has length 516
[2025-03-08 02:01:20,490 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:20,490 INFO  L471      AbstractCegarLoop]: Abstraction has 6378 states and 7425 transitions.
[2025-03-08 02:01:20,491 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-08 02:01:20,491 INFO  L276                IsEmpty]: Start isEmpty. Operand 6378 states and 7425 transitions.
[2025-03-08 02:01:20,497 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 540
[2025-03-08 02:01:20,497 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:20,498 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 02:01:20,506 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 02:01:20,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:20,702 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:20,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:20,703 INFO  L85        PathProgramCache]: Analyzing trace with hash -173866052, now seen corresponding path program 1 times
[2025-03-08 02:01:20,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:20,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43412401]
[2025-03-08 02:01:20,703 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:20,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:20,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes.
[2025-03-08 02:01:20,788 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements.
[2025-03-08 02:01:20,789 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:20,789 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:20,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 487 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked.
[2025-03-08 02:01:20,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:20,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43412401]
[2025-03-08 02:01:20,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43412401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:20,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:20,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:20,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553307717]
[2025-03-08 02:01:20,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:20,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:20,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:20,923 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:20,923 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:20,923 INFO  L87              Difference]: Start difference. First operand 6378 states and 7425 transitions. Second operand  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-08 02:01:22,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:22,057 INFO  L93              Difference]: Finished difference Result 15743 states and 18434 transitions.
[2025-03-08 02:01:22,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:22,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 539
[2025-03-08 02:01:22,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:22,076 INFO  L225             Difference]: With dead ends: 15743
[2025-03-08 02:01:22,076 INFO  L226             Difference]: Without dead ends: 9666
[2025-03-08 02:01:22,081 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-08 02:01:22,082 INFO  L435           NwaCegarLoop]: 227 mSDtfsCounter, 275 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:22,082 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:22,086 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9666 states.
[2025-03-08 02:01:22,180 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 7871.
[2025-03-08 02:01:22,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7871 states, 7870 states have (on average 1.1616264294790344) internal successors, (9142), 7870 states have internal predecessors, (9142), 0 states have call successors, (0), 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-08 02:01:22,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7871 states to 7871 states and 9142 transitions.
[2025-03-08 02:01:22,199 INFO  L78                 Accepts]: Start accepts. Automaton has 7871 states and 9142 transitions. Word has length 539
[2025-03-08 02:01:22,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:22,200 INFO  L471      AbstractCegarLoop]: Abstraction has 7871 states and 9142 transitions.
[2025-03-08 02:01:22,200 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-08 02:01:22,201 INFO  L276                IsEmpty]: Start isEmpty. Operand 7871 states and 9142 transitions.
[2025-03-08 02:01:22,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 554
[2025-03-08 02:01:22,205 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:22,205 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:22,205 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 02:01:22,205 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:22,206 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:22,207 INFO  L85        PathProgramCache]: Analyzing trace with hash -1733825029, now seen corresponding path program 1 times
[2025-03-08 02:01:22,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:22,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568863037]
[2025-03-08 02:01:22,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:22,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:22,239 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes.
[2025-03-08 02:01:22,258 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements.
[2025-03-08 02:01:22,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:22,258 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:22,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 787 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2025-03-08 02:01:22,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:22,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568863037]
[2025-03-08 02:01:22,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568863037] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:22,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:22,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:22,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902072885]
[2025-03-08 02:01:22,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:22,537 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:22,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:22,537 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:22,537 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:22,538 INFO  L87              Difference]: Start difference. First operand 7871 states and 9142 transitions. Second operand  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 02:01:23,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:23,655 INFO  L93              Difference]: Finished difference Result 19043 states and 22343 transitions.
[2025-03-08 02:01:23,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:23,656 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 553
[2025-03-08 02:01:23,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:23,673 INFO  L225             Difference]: With dead ends: 19043
[2025-03-08 02:01:23,673 INFO  L226             Difference]: Without dead ends: 11473
[2025-03-08 02:01:23,680 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-08 02:01:23,681 INFO  L435           NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:23,682 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 02:01:23,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11473 states.
[2025-03-08 02:01:23,759 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11473 to 11163.
[2025-03-08 02:01:23,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11163 states, 11162 states have (on average 1.1483605088693782) internal successors, (12818), 11162 states have internal predecessors, (12818), 0 states have call successors, (0), 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-08 02:01:23,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 12818 transitions.
[2025-03-08 02:01:23,786 INFO  L78                 Accepts]: Start accepts. Automaton has 11163 states and 12818 transitions. Word has length 553
[2025-03-08 02:01:23,786 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:23,786 INFO  L471      AbstractCegarLoop]: Abstraction has 11163 states and 12818 transitions.
[2025-03-08 02:01:23,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 02:01:23,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 11163 states and 12818 transitions.
[2025-03-08 02:01:23,795 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 567
[2025-03-08 02:01:23,795 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:23,795 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 02:01:23,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 02:01:23,795 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:23,796 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:23,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -925236175, now seen corresponding path program 1 times
[2025-03-08 02:01:23,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:23,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402889779]
[2025-03-08 02:01:23,796 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:23,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:23,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes.
[2025-03-08 02:01:23,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements.
[2025-03-08 02:01:23,874 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:23,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:24,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 522 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-08 02:01:24,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:24,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402889779]
[2025-03-08 02:01:24,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402889779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:24,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:24,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:24,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439967998]
[2025-03-08 02:01:24,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:24,019 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:24,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:24,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:24,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:24,020 INFO  L87              Difference]: Start difference. First operand 11163 states and 12818 transitions. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-08 02:01:25,022 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:25,022 INFO  L93              Difference]: Finished difference Result 22322 states and 25668 transitions.
[2025-03-08 02:01:25,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:25,023 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 566
[2025-03-08 02:01:25,023 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:25,042 INFO  L225             Difference]: With dead ends: 22322
[2025-03-08 02:01:25,042 INFO  L226             Difference]: Without dead ends: 11460
[2025-03-08 02:01:25,051 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-08 02:01:25,051 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:25,052 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:01:25,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11460 states.
[2025-03-08 02:01:25,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 11161.
[2025-03-08 02:01:25,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11161 states, 11160 states have (on average 1.1482078853046596) internal successors, (12814), 11160 states have internal predecessors, (12814), 0 states have call successors, (0), 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-08 02:01:25,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 12814 transitions.
[2025-03-08 02:01:25,185 INFO  L78                 Accepts]: Start accepts. Automaton has 11161 states and 12814 transitions. Word has length 566
[2025-03-08 02:01:25,185 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:25,185 INFO  L471      AbstractCegarLoop]: Abstraction has 11161 states and 12814 transitions.
[2025-03-08 02:01:25,186 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-08 02:01:25,186 INFO  L276                IsEmpty]: Start isEmpty. Operand 11161 states and 12814 transitions.
[2025-03-08 02:01:25,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 587
[2025-03-08 02:01:25,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:25,195 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:25,195 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 02:01:25,196 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:25,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:25,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -2031887712, now seen corresponding path program 1 times
[2025-03-08 02:01:25,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:25,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784934074]
[2025-03-08 02:01:25,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:25,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:25,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes.
[2025-03-08 02:01:25,278 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements.
[2025-03-08 02:01:25,279 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:25,279 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:25,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 708 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-03-08 02:01:25,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:25,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784934074]
[2025-03-08 02:01:25,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784934074] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:25,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:25,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:25,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088924780]
[2025-03-08 02:01:25,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:25,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:25,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:25,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:25,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:25,387 INFO  L87              Difference]: Start difference. First operand 11161 states and 12814 transitions. Second operand  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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-08 02:01:26,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:26,233 INFO  L93              Difference]: Finished difference Result 23815 states and 27343 transitions.
[2025-03-08 02:01:26,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:26,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 586
[2025-03-08 02:01:26,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:26,249 INFO  L225             Difference]: With dead ends: 23815
[2025-03-08 02:01:26,249 INFO  L226             Difference]: Without dead ends: 12955
[2025-03-08 02:01:26,257 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-08 02:01:26,258 INFO  L435           NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:26,258 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:01:26,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12955 states.
[2025-03-08 02:01:26,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 9364.
[2025-03-08 02:01:26,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9364 states, 9363 states have (on average 1.161807113104774) internal successors, (10878), 9363 states have internal predecessors, (10878), 0 states have call successors, (0), 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-08 02:01:26,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 10878 transitions.
[2025-03-08 02:01:26,356 INFO  L78                 Accepts]: Start accepts. Automaton has 9364 states and 10878 transitions. Word has length 586
[2025-03-08 02:01:26,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:26,357 INFO  L471      AbstractCegarLoop]: Abstraction has 9364 states and 10878 transitions.
[2025-03-08 02:01:26,357 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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-08 02:01:26,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 9364 states and 10878 transitions.
[2025-03-08 02:01:26,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 593
[2025-03-08 02:01:26,363 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:26,363 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 02:01:26,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 02:01:26,363 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:26,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:26,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 724450181, now seen corresponding path program 1 times
[2025-03-08 02:01:26,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:26,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736687532]
[2025-03-08 02:01:26,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:26,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:26,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes.
[2025-03-08 02:01:26,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements.
[2025-03-08 02:01:26,428 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:26,428 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:26,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 550 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-03-08 02:01:26,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:26,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736687532]
[2025-03-08 02:01:26,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736687532] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:26,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:26,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:26,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748695678]
[2025-03-08 02:01:26,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:26,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:26,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:26,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:26,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:26,687 INFO  L87              Difference]: Start difference. First operand 9364 states and 10878 transitions. Second operand  has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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-08 02:01:27,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:27,693 INFO  L93              Difference]: Finished difference Result 23510 states and 27453 transitions.
[2025-03-08 02:01:27,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:27,694 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 592
[2025-03-08 02:01:27,694 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:27,710 INFO  L225             Difference]: With dead ends: 23510
[2025-03-08 02:01:27,710 INFO  L226             Difference]: Without dead ends: 14447
[2025-03-08 02:01:27,719 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-08 02:01:27,719 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 222 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:27,720 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 203 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:01:27,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14447 states.
[2025-03-08 02:01:27,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14447 to 11756.
[2025-03-08 02:01:27,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11756 states, 11755 states have (on average 1.1770310506167587) internal successors, (13836), 11755 states have internal predecessors, (13836), 0 states have call successors, (0), 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-08 02:01:27,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11756 states to 11756 states and 13836 transitions.
[2025-03-08 02:01:27,832 INFO  L78                 Accepts]: Start accepts. Automaton has 11756 states and 13836 transitions. Word has length 592
[2025-03-08 02:01:27,832 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:27,832 INFO  L471      AbstractCegarLoop]: Abstraction has 11756 states and 13836 transitions.
[2025-03-08 02:01:27,832 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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-08 02:01:27,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 11756 states and 13836 transitions.
[2025-03-08 02:01:27,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 613
[2025-03-08 02:01:27,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:27,838 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 02:01:27,839 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 02:01:27,839 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:27,839 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:27,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 1756630142, now seen corresponding path program 1 times
[2025-03-08 02:01:27,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:27,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239274511]
[2025-03-08 02:01:27,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:27,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:27,877 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes.
[2025-03-08 02:01:27,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements.
[2025-03-08 02:01:27,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:27,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:28,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 570 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked.
[2025-03-08 02:01:28,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:28,039 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239274511]
[2025-03-08 02:01:28,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239274511] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:28,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:28,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:28,039 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874601673]
[2025-03-08 02:01:28,039 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:28,040 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:28,040 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:28,040 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:28,040 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:28,040 INFO  L87              Difference]: Start difference. First operand 11756 states and 13836 transitions. Second operand  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-08 02:01:29,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:29,353 INFO  L93              Difference]: Finished difference Result 26200 states and 31365 transitions.
[2025-03-08 02:01:29,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:29,353 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 612
[2025-03-08 02:01:29,354 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:29,366 INFO  L225             Difference]: With dead ends: 26200
[2025-03-08 02:01:29,366 INFO  L226             Difference]: Without dead ends: 14745
[2025-03-08 02:01:29,374 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-08 02:01:29,374 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 349 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:29,374 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 444 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:01:29,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14745 states.
[2025-03-08 02:01:29,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14745 to 14745.
[2025-03-08 02:01:29,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14745 states, 14744 states have (on average 1.1718665219750406) internal successors, (17278), 14744 states have internal predecessors, (17278), 0 states have call successors, (0), 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-08 02:01:29,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 17278 transitions.
[2025-03-08 02:01:29,485 INFO  L78                 Accepts]: Start accepts. Automaton has 14745 states and 17278 transitions. Word has length 612
[2025-03-08 02:01:29,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:29,485 INFO  L471      AbstractCegarLoop]: Abstraction has 14745 states and 17278 transitions.
[2025-03-08 02:01:29,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-08 02:01:29,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 14745 states and 17278 transitions.
[2025-03-08 02:01:29,491 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 629
[2025-03-08 02:01:29,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:29,491 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:29,492 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 02:01:29,492 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:29,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:29,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -1856530000, now seen corresponding path program 1 times
[2025-03-08 02:01:29,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:29,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082857785]
[2025-03-08 02:01:29,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:29,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:29,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes.
[2025-03-08 02:01:29,592 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements.
[2025-03-08 02:01:29,592 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:29,592 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:29,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 1149 backedges. 692 proven. 39 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-03-08 02:01:29,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:29,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082857785]
[2025-03-08 02:01:29,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082857785] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:01:29,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728734970]
[2025-03-08 02:01:29,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:29,971 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:29,971 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:29,990 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-08 02:01:29,990 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-08 02:01:30,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes.
[2025-03-08 02:01:30,133 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements.
[2025-03-08 02:01:30,133 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:30,133 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:30,136 INFO  L256         TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:01:30,141 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:01:30,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 1149 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked.
[2025-03-08 02:01:30,244 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:01:30,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728734970] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:30,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:01:30,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 02:01:30,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913430958]
[2025-03-08 02:01:30,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:30,245 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:30,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:30,245 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:30,245 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:30,246 INFO  L87              Difference]: Start difference. First operand 14745 states and 17278 transitions. Second operand  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-08 02:01:31,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:31,355 INFO  L93              Difference]: Finished difference Result 31581 states and 37212 transitions.
[2025-03-08 02:01:31,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:31,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 628
[2025-03-08 02:01:31,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:31,373 INFO  L225             Difference]: With dead ends: 31581
[2025-03-08 02:01:31,374 INFO  L226             Difference]: Without dead ends: 17137
[2025-03-08 02:01:31,384 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:31,385 INFO  L435           NwaCegarLoop]: 592 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:31,385 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 630 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 02:01:31,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17137 states.
[2025-03-08 02:01:31,483 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 16837.
[2025-03-08 02:01:31,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16837 states, 16836 states have (on average 1.1313851271085769) internal successors, (19048), 16836 states have internal predecessors, (19048), 0 states have call successors, (0), 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-08 02:01:31,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16837 states to 16837 states and 19048 transitions.
[2025-03-08 02:01:31,509 INFO  L78                 Accepts]: Start accepts. Automaton has 16837 states and 19048 transitions. Word has length 628
[2025-03-08 02:01:31,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:31,509 INFO  L471      AbstractCegarLoop]: Abstraction has 16837 states and 19048 transitions.
[2025-03-08 02:01:31,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-08 02:01:31,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 16837 states and 19048 transitions.
[2025-03-08 02:01:31,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 687
[2025-03-08 02:01:31,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:31,517 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-08 02:01:31,524 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-08 02:01:31,718 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,SelfDestructingSolverStorable13
[2025-03-08 02:01:31,718 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:31,718 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:31,718 INFO  L85        PathProgramCache]: Analyzing trace with hash 1456642152, now seen corresponding path program 1 times
[2025-03-08 02:01:31,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:31,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130687825]
[2025-03-08 02:01:31,718 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:31,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:31,756 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes.
[2025-03-08 02:01:31,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements.
[2025-03-08 02:01:31,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:31,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:32,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 927 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-08 02:01:32,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:32,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130687825]
[2025-03-08 02:01:32,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130687825] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:32,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:32,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 02:01:32,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253690845]
[2025-03-08 02:01:32,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:32,018 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:01:32,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:32,018 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:01:32,018 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:01:32,019 INFO  L87              Difference]: Start difference. First operand 16837 states and 19048 transitions. Second operand  has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-08 02:01:33,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:33,632 INFO  L93              Difference]: Finished difference Result 42344 states and 47496 transitions.
[2025-03-08 02:01:33,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:01:33,633 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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 686
[2025-03-08 02:01:33,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:33,651 INFO  L225             Difference]: With dead ends: 42344
[2025-03-08 02:01:33,651 INFO  L226             Difference]: Without dead ends: 19529
[2025-03-08 02:01:33,664 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-08 02:01:33,664 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 617 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:33,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 452 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-08 02:01:33,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19529 states.
[2025-03-08 02:01:33,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19529 to 16237.
[2025-03-08 02:01:33,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16237 states, 16236 states have (on average 1.045331362404533) internal successors, (16972), 16236 states have internal predecessors, (16972), 0 states have call successors, (0), 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-08 02:01:33,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16237 states to 16237 states and 16972 transitions.
[2025-03-08 02:01:33,861 INFO  L78                 Accepts]: Start accepts. Automaton has 16237 states and 16972 transitions. Word has length 686
[2025-03-08 02:01:33,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:33,862 INFO  L471      AbstractCegarLoop]: Abstraction has 16237 states and 16972 transitions.
[2025-03-08 02:01:33,862 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-08 02:01:33,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 16237 states and 16972 transitions.
[2025-03-08 02:01:33,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 712
[2025-03-08 02:01:33,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:33,871 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:33,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 02:01:33,872 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:33,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:33,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 862654691, now seen corresponding path program 1 times
[2025-03-08 02:01:33,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:33,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598343569]
[2025-03-08 02:01:33,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:33,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:33,921 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes.
[2025-03-08 02:01:33,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements.
[2025-03-08 02:01:33,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:33,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:34,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 887 backedges. 497 proven. 168 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked.
[2025-03-08 02:01:34,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:34,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598343569]
[2025-03-08 02:01:34,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598343569] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:01:34,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989071422]
[2025-03-08 02:01:34,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:34,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:34,895 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:34,899 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-08 02:01:34,902 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-08 02:01:34,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes.
[2025-03-08 02:01:35,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements.
[2025-03-08 02:01:35,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:35,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:35,045 INFO  L256         TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 02:01:35,054 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:01:35,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 887 backedges. 497 proven. 202 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-03-08 02:01:35,445 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 02:01:35,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 887 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked.
[2025-03-08 02:01:35,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989071422] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:01:35,915 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-08 02:01:35,915 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9
[2025-03-08 02:01:35,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936141418]
[2025-03-08 02:01:35,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:35,916 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:35,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:35,917 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:35,917 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:01:35,918 INFO  L87              Difference]: Start difference. First operand 16237 states and 16972 transitions. Second operand  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-08 02:01:36,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:36,847 INFO  L93              Difference]: Finished difference Result 35771 states and 37357 transitions.
[2025-03-08 02:01:36,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:36,848 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 711
[2025-03-08 02:01:36,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:36,868 INFO  L225             Difference]: With dead ends: 35771
[2025-03-08 02:01:36,869 INFO  L226             Difference]: Without dead ends: 19536
[2025-03-08 02:01:36,881 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1425 GetRequests, 1418 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:01:36,882 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 295 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:36,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 92 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:01:36,895 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19536 states.
[2025-03-08 02:01:36,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19536 to 17733.
[2025-03-08 02:01:37,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17733 states, 17732 states have (on average 1.0404917662982178) internal successors, (18450), 17732 states have internal predecessors, (18450), 0 states have call successors, (0), 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-08 02:01:37,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17733 states to 17733 states and 18450 transitions.
[2025-03-08 02:01:37,029 INFO  L78                 Accepts]: Start accepts. Automaton has 17733 states and 18450 transitions. Word has length 711
[2025-03-08 02:01:37,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:37,029 INFO  L471      AbstractCegarLoop]: Abstraction has 17733 states and 18450 transitions.
[2025-03-08 02:01:37,029 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-08 02:01:37,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 17733 states and 18450 transitions.
[2025-03-08 02:01:37,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 838
[2025-03-08 02:01:37,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:37,043 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:01:37,049 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 02:01:37,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:37,243 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:37,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:37,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 253376337, now seen corresponding path program 1 times
[2025-03-08 02:01:37,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:37,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077765319]
[2025-03-08 02:01:37,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:37,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:37,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes.
[2025-03-08 02:01:37,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements.
[2025-03-08 02:01:37,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:37,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:37,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 1382 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked.
[2025-03-08 02:01:37,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:37,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077765319]
[2025-03-08 02:01:37,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077765319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:37,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:37,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:37,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82789511]
[2025-03-08 02:01:37,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:37,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:37,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:37,645 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:37,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:37,646 INFO  L87              Difference]: Start difference. First operand 17733 states and 18450 transitions. Second operand  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-08 02:01:38,440 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:38,441 INFO  L93              Difference]: Finished difference Result 36956 states and 38464 transitions.
[2025-03-08 02:01:38,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:38,441 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 837
[2025-03-08 02:01:38,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:38,465 INFO  L225             Difference]: With dead ends: 36956
[2025-03-08 02:01:38,465 INFO  L226             Difference]: Without dead ends: 19524
[2025-03-08 02:01:38,480 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-08 02:01:38,481 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 342 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:38,481 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 456 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 02:01:38,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19524 states.
[2025-03-08 02:01:38,603 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19524 to 14436.
[2025-03-08 02:01:38,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14436 states, 14435 states have (on average 1.0431589885694492) internal successors, (15058), 14435 states have internal predecessors, (15058), 0 states have call successors, (0), 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-08 02:01:38,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 15058 transitions.
[2025-03-08 02:01:38,625 INFO  L78                 Accepts]: Start accepts. Automaton has 14436 states and 15058 transitions. Word has length 837
[2025-03-08 02:01:38,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:38,626 INFO  L471      AbstractCegarLoop]: Abstraction has 14436 states and 15058 transitions.
[2025-03-08 02:01:38,626 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-08 02:01:38,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 14436 states and 15058 transitions.
[2025-03-08 02:01:38,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 876
[2025-03-08 02:01:38,636 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:38,636 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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]
[2025-03-08 02:01:38,636 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 02:01:38,636 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:38,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:38,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660142265, now seen corresponding path program 1 times
[2025-03-08 02:01:38,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:38,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396147524]
[2025-03-08 02:01:38,637 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:38,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:38,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes.
[2025-03-08 02:01:38,718 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements.
[2025-03-08 02:01:38,718 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:38,718 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:39,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 1435 backedges. 790 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked.
[2025-03-08 02:01:39,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:39,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396147524]
[2025-03-08 02:01:39,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396147524] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:39,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:39,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:39,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471735527]
[2025-03-08 02:01:39,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:39,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:39,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:39,006 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:39,006 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:39,006 INFO  L87              Difference]: Start difference. First operand 14436 states and 15058 transitions. Second operand  has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-08 02:01:39,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:39,674 INFO  L93              Difference]: Finished difference Result 30062 states and 31358 transitions.
[2025-03-08 02:01:39,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:39,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 875
[2025-03-08 02:01:39,675 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:39,675 INFO  L225             Difference]: With dead ends: 30062
[2025-03-08 02:01:39,675 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 02:01:39,685 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-08 02:01:39,686 INFO  L435           NwaCegarLoop]: 459 mSDtfsCounter, 132 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:39,686 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 496 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:01:39,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 02:01:39,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 02:01:39,686 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-08 02:01:39,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 02:01:39,687 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 875
[2025-03-08 02:01:39,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:39,687 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 02:01:39,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-08 02:01:39,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 02:01:39,687 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 02:01:39,689 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 02:01:39,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 02:01:39,693 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:39,694 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 02:01:41,976 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 02:01:41,997 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:01:41 BoogieIcfgContainer
[2025-03-08 02:01:41,997 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 02:01:41,998 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 02:01:41,998 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 02:01:41,998 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 02:01:41,999 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:07" (3/4) ...
[2025-03-08 02:01:42,000 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 02:01:42,026 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-03-08 02:01:42,027 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 02:01:42,028 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 02:01:42,030 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 02:01:42,174 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 02:01:42,174 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 02:01:42,174 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 02:01:42,175 INFO  L158              Benchmark]: Toolchain (without parser) took 37271.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 100.4MB in the beginning and 483.7MB in the end (delta: -383.3MB). Peak memory consumption was 683.1MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,175 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 02:01:42,175 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 634.32ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 86.9MB in the end (delta: 13.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,175 INFO  L158              Benchmark]: Boogie Procedure Inliner took 153.65ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.0MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,175 INFO  L158              Benchmark]: Boogie Preprocessor took 229.49ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 77.1MB in the end (delta: -28.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,176 INFO  L158              Benchmark]: IcfgBuilder took 2028.97ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 77.1MB in the beginning and 184.9MB in the end (delta: -107.9MB). Peak memory consumption was 184.9MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,177 INFO  L158              Benchmark]: TraceAbstraction took 34043.29ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 855.6MB). Free memory was 184.9MB in the beginning and 508.9MB in the end (delta: -323.9MB). Peak memory consumption was 658.3MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,177 INFO  L158              Benchmark]: Witness Printer took 175.90ms. Allocated memory is still 1.2GB. Free memory was 508.9MB in the beginning and 483.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 02:01:42,178 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 634.32ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 86.9MB in the end (delta: 13.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 153.65ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.0MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 229.49ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 77.1MB in the end (delta: -28.0MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2028.97ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 77.1MB in the beginning and 184.9MB in the end (delta: -107.9MB). Peak memory consumption was 184.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 34043.29ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 855.6MB). Free memory was 184.9MB in the beginning and 508.9MB in the end (delta: -323.9MB). Peak memory consumption was 658.3MB. Max. memory is 16.1GB.
 * Witness Printer took 175.90ms. Allocated memory is still 1.2GB. Free memory was 508.9MB in the beginning and 483.7MB in the end (delta: 25.2MB). 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: 212]: 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, 749 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5046 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5046 mSDsluCounter, 7038 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 3587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16586 IncrementalHoareTripleChecker+Invalid, 20173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3587 mSolverCounterUnsat, 6396 mSDtfsCounter, 16586 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2617 GetRequests, 2586 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17733occurred in iteration=16, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 20686 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 10853 NumberOfCodeBlocks, 10853 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11542 ConstructedInterpolants, 0 QuantifiedInterpolants, 25172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2256 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 13406/13854 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) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || ((((long long) 89 + a4) <= 0) && (0 <= ((long long) a29 + 143)))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || ((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0))) || (((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85)))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) a29 + 143)))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || (((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 143)))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((((long long) a4 + 86) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (0 <= ((long long) a29 + 143)))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || ((a2 == 1) && (((long long) a4 + 86) <= 0)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 02:01:42,198 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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