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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6
[2025-02-05 10:42:47,949 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 10:42:47,956 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 10:42:47,960 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 10:42:47,961 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 10:42:47,961 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 10:42:47,962 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label18.c
[2025-02-05 10:42:49,246 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9da4db17/6a8af1c37caa4d5dac342f4dbb0ee830/FLAGd256d870f
[2025-02-05 10:42:49,577 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 10:42:49,579 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c
[2025-02-05 10:42:49,591 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9da4db17/6a8af1c37caa4d5dac342f4dbb0ee830/FLAGd256d870f
[2025-02-05 10:42:49,606 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9da4db17/6a8af1c37caa4d5dac342f4dbb0ee830
[2025-02-05 10:42:49,608 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 10:42:49,609 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 10:42:49,610 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 10:42:49,610 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 10:42:49,613 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 10:42:49,614 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:49" (1/1) ...
[2025-02-05 10:42:49,615 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c58411c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:49, skipping insertion in model container
[2025-02-05 10:42:49,615 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:49" (1/1) ...
[2025-02-05 10:42:49,655 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 10:42:49,936 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998]
[2025-02-05 10:42:49,958 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:42:49,971 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 10:42:50,036 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998]
[2025-02-05 10:42:50,051 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:42:50,069 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 10:42:50,070 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50 WrapperNode
[2025-02-05 10:42:50,071 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 10:42:50,072 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 10:42:50,072 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 10:42:50,072 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 10:42:50,078 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,095 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,146 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655
[2025-02-05 10:42:50,146 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 10:42:50,147 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 10:42:50,147 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 10:42:50,147 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 10:42:50,157 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,157 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,161 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,180 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 10:42:50,181 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,182 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,211 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,213 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,215 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,217 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,223 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 10:42:50,227 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 10:42:50,227 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 10:42:50,227 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 10:42:50,228 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (1/1) ...
[2025-02-05 10:42:50,232 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 10:42:50,243 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:42:50,254 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 10:42:50,256 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 10:42:50,276 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 10:42:50,276 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 10:42:50,276 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 10:42:50,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 10:42:50,340 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 10:42:50,341 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 10:42:51,214 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2025-02-05 10:42:51,215 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 10:42:51,230 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 10:42:51,230 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 10:42:51,231 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:51 BoogieIcfgContainer
[2025-02-05 10:42:51,231 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 10:42:51,233 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 10:42:51,233 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 10:42:51,237 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 10:42:51,237 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:42:49" (1/3) ...
[2025-02-05 10:42:51,238 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d516683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:51, skipping insertion in model container
[2025-02-05 10:42:51,238 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:50" (2/3) ...
[2025-02-05 10:42:51,239 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d516683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:51, skipping insertion in model container
[2025-02-05 10:42:51,239 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:51" (3/3) ...
[2025-02-05 10:42:51,240 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem01_label18.c
[2025-02-05 10:42:51,251 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 10:42:51,252 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label18.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 10:42:51,301 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 10:42:51,313 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;@27ce5c1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 10:42:51,313 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 10:42:51,317 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:51,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2025-02-05 10:42:51,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:51,326 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:51,327 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:51,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:51,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -599099405, now seen corresponding path program 1 times
[2025-02-05 10:42:51,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:51,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749353097]
[2025-02-05 10:42:51,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:51,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:51,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-02-05 10:42:51,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-02-05 10:42:51,571 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:51,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:51,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:42:51,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:51,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749353097]
[2025-02-05 10:42:51,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749353097] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:51,910 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:51,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:42:51,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066454103]
[2025-02-05 10:42:51,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:51,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:51,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:51,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:51,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:51,944 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:52,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:52,649 INFO  L93              Difference]: Finished difference Result 528 states and 912 transitions.
[2025-02-05 10:42:52,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:52,651 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100
[2025-02-05 10:42:52,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:52,659 INFO  L225             Difference]: With dead ends: 528
[2025-02-05 10:42:52,659 INFO  L226             Difference]: Without dead ends: 266
[2025-02-05 10:42:52,662 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:52,664 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 82 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:52,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:42:52,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2025-02-05 10:42:52,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2025-02-05 10:42:52,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:52,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions.
[2025-02-05 10:42:52,712 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 100
[2025-02-05 10:42:52,714 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:52,714 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 374 transitions.
[2025-02-05 10:42:52,714 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:52,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions.
[2025-02-05 10:42:52,719 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2025-02-05 10:42:52,720 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:52,720 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 10:42:52,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 10:42:52,720 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:52,721 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:52,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -1855247562, now seen corresponding path program 1 times
[2025-02-05 10:42:52,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:52,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772000714]
[2025-02-05 10:42:52,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:52,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:52,752 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes.
[2025-02-05 10:42:52,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements.
[2025-02-05 10:42:52,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:52,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:52,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:42:52,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:52,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772000714]
[2025-02-05 10:42:52,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772000714] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:52,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:52,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:52,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320183630]
[2025-02-05 10:42:52,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:52,952 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:52,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:52,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:52,954 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:52,955 INFO  L87              Difference]: Start difference. First operand 266 states and 374 transitions. Second operand  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:53,404 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:53,404 INFO  L93              Difference]: Finished difference Result 792 states and 1117 transitions.
[2025-02-05 10:42:53,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:53,404 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104
[2025-02-05 10:42:53,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:53,408 INFO  L225             Difference]: With dead ends: 792
[2025-02-05 10:42:53,408 INFO  L226             Difference]: Without dead ends: 528
[2025-02-05 10:42:53,410 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:53,413 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:53,413 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 31 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:42:53,415 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2025-02-05 10:42:53,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2025-02-05 10:42:53,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:53,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions.
[2025-02-05 10:42:53,437 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 104
[2025-02-05 10:42:53,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:53,438 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 708 transitions.
[2025-02-05 10:42:53,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:53,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions.
[2025-02-05 10:42:53,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-02-05 10:42:53,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:53,443 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 10:42:53,443 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 10:42:53,443 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:53,443 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:53,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248251127, now seen corresponding path program 1 times
[2025-02-05 10:42:53,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:53,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325998861]
[2025-02-05 10:42:53,444 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:53,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:53,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-05 10:42:53,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-05 10:42:53,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:53,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:53,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 10:42:53,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:53,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325998861]
[2025-02-05 10:42:53,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325998861] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:53,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:53,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:42:53,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110268181]
[2025-02-05 10:42:53,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:53,651 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:53,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:53,652 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:53,652 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:53,652 INFO  L87              Difference]: Start difference. First operand 528 states and 708 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:54,076 INFO  L93              Difference]: Finished difference Result 1316 states and 1785 transitions.
[2025-02-05 10:42:54,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:54,077 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123
[2025-02-05 10:42:54,077 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:54,080 INFO  L225             Difference]: With dead ends: 1316
[2025-02-05 10:42:54,080 INFO  L226             Difference]: Without dead ends: 790
[2025-02-05 10:42:54,081 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:54,082 INFO  L435           NwaCegarLoop]: 25 mSDtfsCounter, 159 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:54,082 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:42:54,083 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 790 states.
[2025-02-05 10:42:54,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659.
[2025-02-05 10:42:54,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 659 states, 658 states have (on average 1.3495440729483283) internal successors, (888), 658 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions.
[2025-02-05 10:42:54,115 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 123
[2025-02-05 10:42:54,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:54,115 INFO  L471      AbstractCegarLoop]: Abstraction has 659 states and 888 transitions.
[2025-02-05 10:42:54,115 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,116 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions.
[2025-02-05 10:42:54,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-02-05 10:42:54,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:54,122 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 10:42:54,122 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 10:42:54,122 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:54,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:54,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 493490157, now seen corresponding path program 1 times
[2025-02-05 10:42:54,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:54,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643643869]
[2025-02-05 10:42:54,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:54,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:54,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-02-05 10:42:54,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-02-05 10:42:54,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:54,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:54,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 10:42:54,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:54,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643643869]
[2025-02-05 10:42:54,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643643869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:54,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:54,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:42:54,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939827378]
[2025-02-05 10:42:54,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:54,366 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:54,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:54,367 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:54,367 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:54,368 INFO  L87              Difference]: Start difference. First operand 659 states and 888 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,727 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:54,728 INFO  L93              Difference]: Finished difference Result 1316 states and 1774 transitions.
[2025-02-05 10:42:54,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:54,728 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 127
[2025-02-05 10:42:54,729 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:54,731 INFO  L225             Difference]: With dead ends: 1316
[2025-02-05 10:42:54,731 INFO  L226             Difference]: Without dead ends: 659
[2025-02-05 10:42:54,732 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:54,734 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:54,735 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 10:42:54,736 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2025-02-05 10:42:54,749 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2025-02-05 10:42:54,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions.
[2025-02-05 10:42:54,752 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 127
[2025-02-05 10:42:54,752 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:54,752 INFO  L471      AbstractCegarLoop]: Abstraction has 659 states and 882 transitions.
[2025-02-05 10:42:54,753 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:54,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions.
[2025-02-05 10:42:54,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-02-05 10:42:54,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:54,755 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:54,755 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 10:42:54,755 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:54,756 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:54,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 1663462090, now seen corresponding path program 1 times
[2025-02-05 10:42:54,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:54,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790078838]
[2025-02-05 10:42:54,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:54,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:54,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-05 10:42:54,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-05 10:42:54,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:54,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:54,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 10:42:54,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:54,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790078838]
[2025-02-05 10:42:54,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790078838] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:54,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:54,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:54,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317775540]
[2025-02-05 10:42:54,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:54,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:42:54,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:54,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:42:54,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:42:54,923 INFO  L87              Difference]: Start difference. First operand 659 states and 882 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:55,525 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:55,525 INFO  L93              Difference]: Finished difference Result 1840 states and 2412 transitions.
[2025-02-05 10:42:55,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:42:55,526 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-02-05 10:42:55,526 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:55,530 INFO  L225             Difference]: With dead ends: 1840
[2025-02-05 10:42:55,531 INFO  L226             Difference]: Without dead ends: 1183
[2025-02-05 10:42:55,532 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:42:55,533 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 394 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:55,533 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 41 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:42:55,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2025-02-05 10:42:55,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052.
[2025-02-05 10:42:55,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1052 states, 1051 states have (on average 1.2645099904852521) internal successors, (1329), 1051 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:55,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1329 transitions.
[2025-02-05 10:42:55,557 INFO  L78                 Accepts]: Start accepts. Automaton has 1052 states and 1329 transitions. Word has length 131
[2025-02-05 10:42:55,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:55,557 INFO  L471      AbstractCegarLoop]: Abstraction has 1052 states and 1329 transitions.
[2025-02-05 10:42:55,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:55,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 1052 states and 1329 transitions.
[2025-02-05 10:42:55,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-02-05 10:42:55,560 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:55,560 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:55,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 10:42:55,560 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:55,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:55,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 1897598550, now seen corresponding path program 1 times
[2025-02-05 10:42:55,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:55,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866300308]
[2025-02-05 10:42:55,561 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:55,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:55,582 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-02-05 10:42:55,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-02-05 10:42:55,588 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:55,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:55,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-02-05 10:42:55,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:55,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866300308]
[2025-02-05 10:42:55,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866300308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:55,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:55,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:55,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283267292]
[2025-02-05 10:42:55,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:55,716 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:55,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:55,717 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:55,717 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:55,717 INFO  L87              Difference]: Start difference. First operand 1052 states and 1329 transitions. Second operand  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,127 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:56,127 INFO  L93              Difference]: Finished difference Result 2757 states and 3455 transitions.
[2025-02-05 10:42:56,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:56,127 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140
[2025-02-05 10:42:56,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:56,133 INFO  L225             Difference]: With dead ends: 2757
[2025-02-05 10:42:56,134 INFO  L226             Difference]: Without dead ends: 1707
[2025-02-05 10:42:56,135 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:56,136 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:56,136 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 23 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:42:56,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1707 states.
[2025-02-05 10:42:56,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1314.
[2025-02-05 10:42:56,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1314 states, 1313 states have (on average 1.2482863670982483) internal successors, (1639), 1313 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1639 transitions.
[2025-02-05 10:42:56,168 INFO  L78                 Accepts]: Start accepts. Automaton has 1314 states and 1639 transitions. Word has length 140
[2025-02-05 10:42:56,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:56,168 INFO  L471      AbstractCegarLoop]: Abstraction has 1314 states and 1639 transitions.
[2025-02-05 10:42:56,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 1314 states and 1639 transitions.
[2025-02-05 10:42:56,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-02-05 10:42:56,171 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:56,171 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:56,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 10:42:56,171 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:56,172 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:56,172 INFO  L85        PathProgramCache]: Analyzing trace with hash 788401413, now seen corresponding path program 1 times
[2025-02-05 10:42:56,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:56,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938988933]
[2025-02-05 10:42:56,172 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:56,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:56,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-02-05 10:42:56,197 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-02-05 10:42:56,198 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:56,198 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:56,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-02-05 10:42:56,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:56,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938988933]
[2025-02-05 10:42:56,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938988933] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:56,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:56,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:42:56,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772319998]
[2025-02-05 10:42:56,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:56,362 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:56,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:56,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:56,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:56,362 INFO  L87              Difference]: Start difference. First operand 1314 states and 1639 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:56,722 INFO  L93              Difference]: Finished difference Result 2626 states and 3276 transitions.
[2025-02-05 10:42:56,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:56,723 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 156
[2025-02-05 10:42:56,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:56,727 INFO  L225             Difference]: With dead ends: 2626
[2025-02-05 10:42:56,728 INFO  L226             Difference]: Without dead ends: 1314
[2025-02-05 10:42:56,729 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:56,729 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:56,730 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 10:42:56,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2025-02-05 10:42:56,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314.
[2025-02-05 10:42:56,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1314 states, 1313 states have (on average 1.2345773038842345) internal successors, (1621), 1313 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1621 transitions.
[2025-02-05 10:42:56,753 INFO  L78                 Accepts]: Start accepts. Automaton has 1314 states and 1621 transitions. Word has length 156
[2025-02-05 10:42:56,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:56,754 INFO  L471      AbstractCegarLoop]: Abstraction has 1314 states and 1621 transitions.
[2025-02-05 10:42:56,754 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:56,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 1314 states and 1621 transitions.
[2025-02-05 10:42:56,756 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-05 10:42:56,756 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:56,756 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:56,757 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 10:42:56,757 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:56,757 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:56,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 1546132296, now seen corresponding path program 1 times
[2025-02-05 10:42:56,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:56,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825498615]
[2025-02-05 10:42:56,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:56,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:56,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-05 10:42:56,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-05 10:42:56,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:56,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:56,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 106 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-02-05 10:42:56,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:56,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825498615]
[2025-02-05 10:42:56,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825498615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:56,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:56,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 10:42:56,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569212118]
[2025-02-05 10:42:56,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:56,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:42:56,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:56,995 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:42:56,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:42:56,995 INFO  L87              Difference]: Start difference. First operand 1314 states and 1621 transitions. Second operand  has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:57,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:57,622 INFO  L93              Difference]: Finished difference Result 3412 states and 4134 transitions.
[2025-02-05 10:42:57,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:42:57,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 160
[2025-02-05 10:42:57,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:57,629 INFO  L225             Difference]: With dead ends: 3412
[2025-02-05 10:42:57,629 INFO  L226             Difference]: Without dead ends: 1969
[2025-02-05 10:42:57,632 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-02-05 10:42:57,632 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 245 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:57,632 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 41 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:42:57,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2025-02-05 10:42:57,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2025-02-05 10:42:57,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1963657678780775) internal successors, (2041), 1706 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:57,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2041 transitions.
[2025-02-05 10:42:57,667 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 2041 transitions. Word has length 160
[2025-02-05 10:42:57,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:57,668 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 2041 transitions.
[2025-02-05 10:42:57,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:57,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 2041 transitions.
[2025-02-05 10:42:57,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2025-02-05 10:42:57,672 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:57,672 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:57,672 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 10:42:57,672 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:57,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:57,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 802637584, now seen corresponding path program 1 times
[2025-02-05 10:42:57,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:57,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809235829]
[2025-02-05 10:42:57,673 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:57,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:57,694 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes.
[2025-02-05 10:42:57,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements.
[2025-02-05 10:42:57,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:57,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:57,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-02-05 10:42:57,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:57,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809235829]
[2025-02-05 10:42:57,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809235829] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:57,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:57,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:57,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915240438]
[2025-02-05 10:42:57,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:57,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:57,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:57,902 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:57,902 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:57,902 INFO  L87              Difference]: Start difference. First operand 1707 states and 2041 transitions. Second operand  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:58,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:58,284 INFO  L93              Difference]: Finished difference Result 3674 states and 4366 transitions.
[2025-02-05 10:42:58,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:58,285 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 177
[2025-02-05 10:42:58,285 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:58,292 INFO  L225             Difference]: With dead ends: 3674
[2025-02-05 10:42:58,292 INFO  L226             Difference]: Without dead ends: 1969
[2025-02-05 10:42:58,295 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:58,295 INFO  L435           NwaCegarLoop]: 42 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:58,296 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 47 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:42:58,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2025-02-05 10:42:58,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2025-02-05 10:42:58,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1934349355216882) internal successors, (2036), 1706 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:58,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2036 transitions.
[2025-02-05 10:42:58,331 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 2036 transitions. Word has length 177
[2025-02-05 10:42:58,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:58,331 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 2036 transitions.
[2025-02-05 10:42:58,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:58,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 2036 transitions.
[2025-02-05 10:42:58,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-05 10:42:58,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:58,335 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:58,336 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 10:42:58,336 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:58,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:58,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 323772262, now seen corresponding path program 1 times
[2025-02-05 10:42:58,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:58,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910415586]
[2025-02-05 10:42:58,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:58,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:58,360 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 10:42:58,365 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 10:42:58,366 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:58,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:58,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 231 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-02-05 10:42:58,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:58,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910415586]
[2025-02-05 10:42:58,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910415586] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:58,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:58,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:58,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814972886]
[2025-02-05 10:42:58,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:58,581 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:42:58,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:58,582 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:42:58,582 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:42:58,582 INFO  L87              Difference]: Start difference. First operand 1707 states and 2036 transitions. Second operand  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:59,144 INFO  L93              Difference]: Finished difference Result 3674 states and 4360 transitions.
[2025-02-05 10:42:59,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:42:59,145 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202
[2025-02-05 10:42:59,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:59,154 INFO  L225             Difference]: With dead ends: 3674
[2025-02-05 10:42:59,154 INFO  L226             Difference]: Without dead ends: 1969
[2025-02-05 10:42:59,157 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:42:59,157 INFO  L435           NwaCegarLoop]: 43 mSDtfsCounter, 265 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:59,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 51 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:42:59,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2025-02-05 10:42:59,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838.
[2025-02-05 10:42:59,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.1823625476320088) internal successors, (2172), 1837 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2172 transitions.
[2025-02-05 10:42:59,199 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2172 transitions. Word has length 202
[2025-02-05 10:42:59,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:59,199 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2172 transitions.
[2025-02-05 10:42:59,199 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,199 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2172 transitions.
[2025-02-05 10:42:59,203 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-02-05 10:42:59,203 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:59,204 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:42:59,204 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 10:42:59,204 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:59,205 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:59,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 828695034, now seen corresponding path program 1 times
[2025-02-05 10:42:59,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:59,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497379050]
[2025-02-05 10:42:59,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:59,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:59,239 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 10:42:59,253 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 10:42:59,254 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:59,254 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:42:59,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-02-05 10:42:59,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:42:59,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497379050]
[2025-02-05 10:42:59,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497379050] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:42:59,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:42:59,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:42:59,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670625432]
[2025-02-05 10:42:59,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:42:59,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:42:59,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:42:59,410 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:42:59,410 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:59,410 INFO  L87              Difference]: Start difference. First operand 1838 states and 2172 transitions. Second operand  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,838 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:42:59,838 INFO  L93              Difference]: Finished difference Result 4067 states and 4799 transitions.
[2025-02-05 10:42:59,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:42:59,839 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 220
[2025-02-05 10:42:59,839 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:42:59,847 INFO  L225             Difference]: With dead ends: 4067
[2025-02-05 10:42:59,848 INFO  L226             Difference]: Without dead ends: 2231
[2025-02-05 10:42:59,851 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:42:59,853 INFO  L435           NwaCegarLoop]: 186 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:42:59,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 192 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:42:59,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2025-02-05 10:42:59,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100.
[2025-02-05 10:42:59,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2100 states, 2099 states have (on average 1.1643639828489758) internal successors, (2444), 2099 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2444 transitions.
[2025-02-05 10:42:59,908 INFO  L78                 Accepts]: Start accepts. Automaton has 2100 states and 2444 transitions. Word has length 220
[2025-02-05 10:42:59,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:42:59,909 INFO  L471      AbstractCegarLoop]: Abstraction has 2100 states and 2444 transitions.
[2025-02-05 10:42:59,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:42:59,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 2100 states and 2444 transitions.
[2025-02-05 10:42:59,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 10:42:59,914 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:42:59,915 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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]
[2025-02-05 10:42:59,915 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 10:42:59,915 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:42:59,915 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:42:59,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -419971983, now seen corresponding path program 1 times
[2025-02-05 10:42:59,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:42:59,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134903965]
[2025-02-05 10:42:59,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:42:59,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:42:59,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 10:42:59,962 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 10:42:59,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:42:59,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:00,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-02-05 10:43:00,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:43:00,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134903965]
[2025-02-05 10:43:00,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134903965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:43:00,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:43:00,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:43:00,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907900770]
[2025-02-05 10:43:00,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:43:00,043 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:43:00,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:43:00,044 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:43:00,044 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:43:00,044 INFO  L87              Difference]: Start difference. First operand 2100 states and 2444 transitions. Second operand  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:00,433 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:43:00,433 INFO  L93              Difference]: Finished difference Result 4198 states and 4886 transitions.
[2025-02-05 10:43:00,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:43:00,434 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 233
[2025-02-05 10:43:00,434 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:43:00,440 INFO  L225             Difference]: With dead ends: 4198
[2025-02-05 10:43:00,441 INFO  L226             Difference]: Without dead ends: 2100
[2025-02-05 10:43:00,443 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:43:00,444 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:43:00,444 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 177 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:43:00,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2025-02-05 10:43:00,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100.
[2025-02-05 10:43:00,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2100 states, 2099 states have (on average 1.1333968556455456) internal successors, (2379), 2099 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:00,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2379 transitions.
[2025-02-05 10:43:00,483 INFO  L78                 Accepts]: Start accepts. Automaton has 2100 states and 2379 transitions. Word has length 233
[2025-02-05 10:43:00,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:43:00,483 INFO  L471      AbstractCegarLoop]: Abstraction has 2100 states and 2379 transitions.
[2025-02-05 10:43:00,484 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:00,484 INFO  L276                IsEmpty]: Start isEmpty. Operand 2100 states and 2379 transitions.
[2025-02-05 10:43:00,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-02-05 10:43:00,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:43:00,488 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:43:00,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 10:43:00,489 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:43:00,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:43:00,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -465685743, now seen corresponding path program 1 times
[2025-02-05 10:43:00,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:43:00,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598589766]
[2025-02-05 10:43:00,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:00,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:43:00,520 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-02-05 10:43:00,538 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-02-05 10:43:00,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:00,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:00,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-02-05 10:43:01,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:43:01,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598589766]
[2025-02-05 10:43:01,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598589766] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:43:01,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015668494]
[2025-02-05 10:43:01,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:01,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:43:01,002 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:43:01,006 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 10:43:01,008 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 10:43:01,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-02-05 10:43:01,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-02-05 10:43:01,148 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:01,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:01,152 INFO  L256         TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:43:01,159 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:43:01,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-02-05 10:43:01,318 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:43:01,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015668494] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:43:01,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:43:01,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 10:43:01,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81499727]
[2025-02-05 10:43:01,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:43:01,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:43:01,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:43:01,320 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:43:01,320 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 10:43:01,320 INFO  L87              Difference]: Start difference. First operand 2100 states and 2379 transitions. Second operand  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:01,699 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:43:01,699 INFO  L93              Difference]: Finished difference Result 2888 states and 3268 transitions.
[2025-02-05 10:43:01,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:43:01,700 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242
[2025-02-05 10:43:01,700 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:43:01,709 INFO  L225             Difference]: With dead ends: 2888
[2025-02-05 10:43:01,710 INFO  L226             Difference]: Without dead ends: 2886
[2025-02-05 10:43:01,712 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 10:43:01,713 INFO  L435           NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:43:01,713 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 30 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:43:01,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2886 states.
[2025-02-05 10:43:01,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2231.
[2025-02-05 10:43:01,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2231 states, 2230 states have (on average 1.1385650224215247) internal successors, (2539), 2230 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:01,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2539 transitions.
[2025-02-05 10:43:01,759 INFO  L78                 Accepts]: Start accepts. Automaton has 2231 states and 2539 transitions. Word has length 242
[2025-02-05 10:43:01,759 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:43:01,759 INFO  L471      AbstractCegarLoop]: Abstraction has 2231 states and 2539 transitions.
[2025-02-05 10:43:01,760 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:01,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 2231 states and 2539 transitions.
[2025-02-05 10:43:01,764 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2025-02-05 10:43:01,765 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:43:01,766 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:43:01,775 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 10:43:01,970 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-02-05 10:43:01,970 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:43:01,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:43:01,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 595058330, now seen corresponding path program 1 times
[2025-02-05 10:43:01,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:43:01,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872297348]
[2025-02-05 10:43:01,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:01,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:43:02,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes.
[2025-02-05 10:43:02,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements.
[2025-02-05 10:43:02,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:02,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:02,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 111 proven. 216 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-02-05 10:43:02,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:43:02,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872297348]
[2025-02-05 10:43:02,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872297348] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:43:02,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606924924]
[2025-02-05 10:43:02,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:02,487 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:43:02,487 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:43:02,489 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 10:43:02,492 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 10:43:02,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes.
[2025-02-05 10:43:02,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements.
[2025-02-05 10:43:02,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:02,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:02,647 INFO  L256         TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:43:02,652 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:43:02,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked.
[2025-02-05 10:43:02,827 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:43:02,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606924924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:43:02,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:43:02,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-02-05 10:43:02,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286586622]
[2025-02-05 10:43:02,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:43:02,828 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:43:02,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:43:02,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:43:02,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 10:43:02,831 INFO  L87              Difference]: Start difference. First operand 2231 states and 2539 transitions. Second operand  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:03,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:43:03,206 INFO  L93              Difference]: Finished difference Result 4460 states and 5076 transitions.
[2025-02-05 10:43:03,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:43:03,207 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 271
[2025-02-05 10:43:03,207 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:43:03,213 INFO  L225             Difference]: With dead ends: 4460
[2025-02-05 10:43:03,213 INFO  L226             Difference]: Without dead ends: 2231
[2025-02-05 10:43:03,215 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 10:43:03,216 INFO  L435           NwaCegarLoop]: 186 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 10:43:03,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 192 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 10:43:03,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2025-02-05 10:43:03,242 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231.
[2025-02-05 10:43:03,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2231 states, 2230 states have (on average 1.1139013452914799) internal successors, (2484), 2230 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:03,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2484 transitions.
[2025-02-05 10:43:03,248 INFO  L78                 Accepts]: Start accepts. Automaton has 2231 states and 2484 transitions. Word has length 271
[2025-02-05 10:43:03,249 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:43:03,249 INFO  L471      AbstractCegarLoop]: Abstraction has 2231 states and 2484 transitions.
[2025-02-05 10:43:03,249 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:03,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 2231 states and 2484 transitions.
[2025-02-05 10:43:03,254 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2025-02-05 10:43:03,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:43:03,255 INFO  L218           NwaCegarLoop]: trace histogram [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, 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]
[2025-02-05 10:43:03,263 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 10:43:03,455 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:43:03,456 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:43:03,456 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:43:03,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 1347130779, now seen corresponding path program 1 times
[2025-02-05 10:43:03,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:43:03,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357776440]
[2025-02-05 10:43:03,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:03,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:43:03,485 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes.
[2025-02-05 10:43:03,504 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements.
[2025-02-05 10:43:03,505 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:03,505 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:03,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 360 backedges. 182 proven. 103 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-02-05 10:43:03,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:43:03,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357776440]
[2025-02-05 10:43:03,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357776440] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:43:03,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110010997]
[2025-02-05 10:43:03,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:43:03,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:43:03,977 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:43:03,978 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 10:43:03,981 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 10:43:04,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes.
[2025-02-05 10:43:04,109 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements.
[2025-02-05 10:43:04,110 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:43:04,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:43:04,112 INFO  L256         TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:43:04,115 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:43:04,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked.
[2025-02-05 10:43:04,249 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:43:04,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110010997] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:43:04,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:43:04,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 10:43:04,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389415685]
[2025-02-05 10:43:04,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:43:04,250 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:43:04,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:43:04,250 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:43:04,250 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 10:43:04,250 INFO  L87              Difference]: Start difference. First operand 2231 states and 2484 transitions. Second operand  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:04,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:43:04,649 INFO  L93              Difference]: Finished difference Result 4458 states and 4965 transitions.
[2025-02-05 10:43:04,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:43:04,650 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 284
[2025-02-05 10:43:04,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:43:04,651 INFO  L225             Difference]: With dead ends: 4458
[2025-02-05 10:43:04,651 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 10:43:04,654 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 10:43:04,654 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 10:43:04,654 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 171 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 10:43:04,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 10:43:04,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 10:43:04,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:04,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 10:43:04,657 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284
[2025-02-05 10:43:04,657 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:43:04,657 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 10:43:04,657 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:43:04,658 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 10:43:04,658 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 10:43:04,660 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 10:43:04,668 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 10:43:04,861 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:43:04,865 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:43:04,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 10:43:05,236 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 10:43:05,252 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:43:05 BoogieIcfgContainer
[2025-02-05 10:43:05,253 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 10:43:05,253 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 10:43:05,253 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 10:43:05,253 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 10:43:05,254 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:51" (3/4) ...
[2025-02-05 10:43:05,256 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 10:43:05,275 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-02-05 10:43:05,276 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 10:43:05,277 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 10:43:05,278 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 10:43:05,405 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 10:43:05,406 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 10:43:05,406 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 10:43:05,407 INFO  L158              Benchmark]: Toolchain (without parser) took 15797.86ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 103.6MB in the beginning and 303.3MB in the end (delta: -199.6MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,407 INFO  L158              Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 10:43:05,408 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 461.04ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 76.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,408 INFO  L158              Benchmark]: Boogie Procedure Inliner took 74.68ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 71.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,408 INFO  L158              Benchmark]: Boogie Preprocessor took 78.16ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 67.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 10:43:05,408 INFO  L158              Benchmark]: IcfgBuilder took 1004.37ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 52.3MB in the end (delta: 14.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,409 INFO  L158              Benchmark]: TraceAbstraction took 14019.80ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 51.7MB in the beginning and 315.9MB in the end (delta: -264.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,409 INFO  L158              Benchmark]: Witness Printer took 153.31ms. Allocated memory is still 453.0MB. Free memory was 315.9MB in the beginning and 303.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 10:43:05,412 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.88ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 461.04ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 76.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 74.68ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 71.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 78.16ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 67.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 1004.37ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 52.3MB in the end (delta: 14.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 14019.80ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 51.7MB in the beginning and 315.9MB in the end (delta: -264.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB.
 * Witness Printer took 153.31ms. Allocated memory is still 453.0MB. Free memory was 315.9MB in the beginning and 303.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 486]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1988 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1988 mSDsluCounter, 1222 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5727 IncrementalHoareTripleChecker+Invalid, 6615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 888 mSolverCounterUnsat, 1131 mSDtfsCounter, 5727 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=13, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 2096 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3467 NumberOfCodeBlocks, 3467 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3449 ConstructedInterpolants, 0 QuantifiedInterpolants, 12183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1406 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2921/3323 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Location Invariant
    Derived location invariant: (((((((((((((a16 == 6) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8)) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || (((a21 <= 0) && (a17 <= 0)) && (a20 == 1))) || (((((5 == a16) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((((a7 != 1) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (15 <= a8))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((((a16 == 6) && (a7 != 1)) && (a17 <= 0)) && (a21 == 1)) && (15 <= a8))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 10:43:05,430 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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