./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923
[2025-03-08 13:11:19,995 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 13:11:20,004 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 13:11:20,006 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 13:11:20,007 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 13:11:20,007 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 13:11:20,009 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i
[2025-03-08 13:11:21,154 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987329261/1905a5539b1044a8946d933ca8756ee9/FLAGed006ab09
[2025-03-08 13:11:21,380 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 13:11:21,381 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i
[2025-03-08 13:11:21,387 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987329261/1905a5539b1044a8946d933ca8756ee9/FLAGed006ab09
[2025-03-08 13:11:21,712 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987329261/1905a5539b1044a8946d933ca8756ee9
[2025-03-08 13:11:21,714 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 13:11:21,716 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 13:11:21,717 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 13:11:21,717 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 13:11:21,720 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 13:11:21,720 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:21,722 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3002e808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21, skipping insertion in model container
[2025-03-08 13:11:21,723 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:21,739 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 13:11:21,835 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931]
[2025-03-08 13:11:21,897 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:11:21,910 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 13:11:21,919 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931]
[2025-03-08 13:11:21,957 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:11:21,973 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 13:11:21,973 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21 WrapperNode
[2025-03-08 13:11:21,974 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 13:11:21,975 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 13:11:21,975 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 13:11:21,975 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 13:11:21,979 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:21,987 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,019 INFO  L138                Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271
[2025-03-08 13:11:22,022 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 13:11:22,023 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 13:11:22,023 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 13:11:22,023 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 13:11:22,029 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,029 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,034 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,048 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 13:11:22,049 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,049 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,061 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,062 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,066 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,067 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,071 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 13:11:22,072 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 13:11:22,072 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 13:11:22,072 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 13:11:22,074 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (1/1) ...
[2025-03-08 13:11:22,077 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 13:11:22,085 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:11:22,097 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 13:11:22,098 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 13:11:22,112 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 13:11:22,112 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 13:11:22,112 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 13:11:22,112 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 13:11:22,112 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 13:11:22,112 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 13:11:22,178 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 13:11:22,180 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 13:11:22,548 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1;
[2025-03-08 13:11:22,590 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-03-08 13:11:22,590 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 13:11:22,610 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 13:11:22,610 INFO  L336             CfgBuilder]: Removed 1 assume(true) statements.
[2025-03-08 13:11:22,611 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:11:22 BoogieIcfgContainer
[2025-03-08 13:11:22,611 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 13:11:22,612 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 13:11:22,612 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 13:11:22,617 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 13:11:22,617 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:11:21" (1/3) ...
[2025-03-08 13:11:22,617 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d76fca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:11:22, skipping insertion in model container
[2025-03-08 13:11:22,618 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:11:21" (2/3) ...
[2025-03-08 13:11:22,618 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d76fca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:11:22, skipping insertion in model container
[2025-03-08 13:11:22,618 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:11:22" (3/3) ...
[2025-03-08 13:11:22,619 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i
[2025-03-08 13:11:22,630 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 13:11:22,632 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 13:11:22,680 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 13:11:22,690 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;@640c8df6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 13:11:22,691 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 13:11:22,693 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-08 13:11:22,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-08 13:11:22,707 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:22,708 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:22,709 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:22,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:22,714 INFO  L85        PathProgramCache]: Analyzing trace with hash 860248976, now seen corresponding path program 1 times
[2025-03-08 13:11:22,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:22,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896072970]
[2025-03-08 13:11:22,720 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:22,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:22,812 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:11:22,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:11:22,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:22,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:23,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-08 13:11:23,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:23,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896072970]
[2025-03-08 13:11:23,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896072970] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:11:23,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463222967]
[2025-03-08 13:11:23,017 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:23,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:11:23,017 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:11:23,019 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:11:23,021 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 13:11:23,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:11:23,180 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:11:23,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:23,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:23,184 INFO  L256         TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 13:11:23,197 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:11:23,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-08 13:11:23,225 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:11:23,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [463222967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:23,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 13:11:23,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 13:11:23,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215521912]
[2025-03-08 13:11:23,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:23,230 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 13:11:23,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:23,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 13:11:23,244 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:11:23,246 INFO  L87              Difference]: Start difference. First operand  has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:11:23,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:23,288 INFO  L93              Difference]: Finished difference Result 238 states and 421 transitions.
[2025-03-08 13:11:23,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 13:11:23,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221
[2025-03-08 13:11:23,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:23,298 INFO  L225             Difference]: With dead ends: 238
[2025-03-08 13:11:23,298 INFO  L226             Difference]: Without dead ends: 119
[2025-03-08 13:11:23,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:11:23,303 INFO  L435           NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:23,304 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:11:23,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-03-08 13:11:23,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-03-08 13:11:23,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-08 13:11:23,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions.
[2025-03-08 13:11:23,337 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 221
[2025-03-08 13:11:23,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:23,338 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 190 transitions.
[2025-03-08 13:11:23,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:11:23,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions.
[2025-03-08 13:11:23,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-08 13:11:23,341 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:23,342 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:23,349 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 13:11:23,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 13:11:23,542 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:23,543 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:23,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -851510476, now seen corresponding path program 1 times
[2025-03-08 13:11:23,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:23,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345961219]
[2025-03-08 13:11:23,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:23,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:23,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:11:23,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:11:23,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:23,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:23,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:23,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:23,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345961219]
[2025-03-08 13:11:23,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345961219] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:23,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:23,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:11:23,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979653180]
[2025-03-08 13:11:23,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:23,906 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:11:23,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:23,907 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:11:23,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:11:23,910 INFO  L87              Difference]: Start difference. First operand 119 states and 190 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:24,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:24,104 INFO  L93              Difference]: Finished difference Result 352 states and 566 transitions.
[2025-03-08 13:11:24,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:11:24,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221
[2025-03-08 13:11:24,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:24,108 INFO  L225             Difference]: With dead ends: 352
[2025-03-08 13:11:24,110 INFO  L226             Difference]: Without dead ends: 236
[2025-03-08 13:11:24,111 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:11:24,112 INFO  L435           NwaCegarLoop]: 179 mSDtfsCounter, 127 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:24,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 458 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:11:24,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2025-03-08 13:11:24,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233.
[2025-03-08 13:11:24,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 233 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-08 13:11:24,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions.
[2025-03-08 13:11:24,159 INFO  L78                 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 221
[2025-03-08 13:11:24,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:24,159 INFO  L471      AbstractCegarLoop]: Abstraction has 233 states and 375 transitions.
[2025-03-08 13:11:24,159 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:24,159 INFO  L276                IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions.
[2025-03-08 13:11:24,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-03-08 13:11:24,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:24,165 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:24,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 13:11:24,165 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:24,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:24,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -109221483, now seen corresponding path program 1 times
[2025-03-08 13:11:24,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:24,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854375802]
[2025-03-08 13:11:24,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:24,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:24,186 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-08 13:11:24,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-08 13:11:24,224 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:24,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:24,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:24,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:24,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854375802]
[2025-03-08 13:11:24,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854375802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:24,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:24,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:11:24,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078487512]
[2025-03-08 13:11:24,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:24,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:11:24,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:24,410 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:11:24,410 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:11:24,410 INFO  L87              Difference]: Start difference. First operand 233 states and 375 transitions. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:24,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:24,572 INFO  L93              Difference]: Finished difference Result 466 states and 750 transitions.
[2025-03-08 13:11:24,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:11:24,573 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222
[2025-03-08 13:11:24,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:24,576 INFO  L225             Difference]: With dead ends: 466
[2025-03-08 13:11:24,579 INFO  L226             Difference]: Without dead ends: 236
[2025-03-08 13:11:24,579 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:24,580 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 125 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:24,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 459 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:11:24,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2025-03-08 13:11:24,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232.
[2025-03-08 13:11:24,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 232 states, 161 states have (on average 1.4720496894409938) internal successors, (237), 161 states have internal predecessors, (237), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-08 13:11:24,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 373 transitions.
[2025-03-08 13:11:24,615 INFO  L78                 Accepts]: Start accepts. Automaton has 232 states and 373 transitions. Word has length 222
[2025-03-08 13:11:24,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:24,617 INFO  L471      AbstractCegarLoop]: Abstraction has 232 states and 373 transitions.
[2025-03-08 13:11:24,617 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:24,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 232 states and 373 transitions.
[2025-03-08 13:11:24,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-03-08 13:11:24,622 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:24,622 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:24,622 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 13:11:24,622 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:24,623 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:24,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1229298669, now seen corresponding path program 1 times
[2025-03-08 13:11:24,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:24,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472315014]
[2025-03-08 13:11:24,623 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:24,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:24,638 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-08 13:11:24,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-08 13:11:24,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:24,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:24,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:24,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:24,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472315014]
[2025-03-08 13:11:24,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472315014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:24,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:24,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:24,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159508048]
[2025-03-08 13:11:24,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:24,847 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:24,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:24,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:24,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:24,847 INFO  L87              Difference]: Start difference. First operand 232 states and 373 transitions. Second operand  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:24,934 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:24,934 INFO  L93              Difference]: Finished difference Result 690 states and 1113 transitions.
[2025-03-08 13:11:24,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:24,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222
[2025-03-08 13:11:24,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:24,941 INFO  L225             Difference]: With dead ends: 690
[2025-03-08 13:11:24,941 INFO  L226             Difference]: Without dead ends: 461
[2025-03-08 13:11:24,942 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:24,943 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 108 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:24,944 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 356 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:11:24,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 461 states.
[2025-03-08 13:11:25,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459.
[2025-03-08 13:11:25,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 459 states, 318 states have (on average 1.4528301886792452) internal successors, (462), 318 states have internal predecessors, (462), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136)
[2025-03-08 13:11:25,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 734 transitions.
[2025-03-08 13:11:25,014 INFO  L78                 Accepts]: Start accepts. Automaton has 459 states and 734 transitions. Word has length 222
[2025-03-08 13:11:25,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:25,014 INFO  L471      AbstractCegarLoop]: Abstraction has 459 states and 734 transitions.
[2025-03-08 13:11:25,014 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:25,014 INFO  L276                IsEmpty]: Start isEmpty. Operand 459 states and 734 transitions.
[2025-03-08 13:11:25,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:11:25,017 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:25,017 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:25,017 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 13:11:25,017 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:25,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:25,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 1033412344, now seen corresponding path program 1 times
[2025-03-08 13:11:25,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:25,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53360171]
[2025-03-08 13:11:25,018 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:25,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:25,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:11:25,052 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:11:25,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:25,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:25,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:25,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:25,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53360171]
[2025-03-08 13:11:25,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53360171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:25,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:25,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:25,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602120761]
[2025-03-08 13:11:25,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:25,124 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:25,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:25,124 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:25,124 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:25,125 INFO  L87              Difference]: Start difference. First operand 459 states and 734 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:25,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:25,189 INFO  L93              Difference]: Finished difference Result 1041 states and 1654 transitions.
[2025-03-08 13:11:25,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:25,190 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223
[2025-03-08 13:11:25,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:25,194 INFO  L225             Difference]: With dead ends: 1041
[2025-03-08 13:11:25,194 INFO  L226             Difference]: Without dead ends: 585
[2025-03-08 13:11:25,197 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:25,198 INFO  L435           NwaCegarLoop]: 217 mSDtfsCounter, 43 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:25,198 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 382 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:11:25,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 585 states.
[2025-03-08 13:11:25,248 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 495.
[2025-03-08 13:11:25,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 495 states, 354 states have (on average 1.4519774011299436) internal successors, (514), 354 states have internal predecessors, (514), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136)
[2025-03-08 13:11:25,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 786 transitions.
[2025-03-08 13:11:25,253 INFO  L78                 Accepts]: Start accepts. Automaton has 495 states and 786 transitions. Word has length 223
[2025-03-08 13:11:25,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:25,255 INFO  L471      AbstractCegarLoop]: Abstraction has 495 states and 786 transitions.
[2025-03-08 13:11:25,255 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:25,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 495 states and 786 transitions.
[2025-03-08 13:11:25,258 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:11:25,258 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:25,258 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:25,258 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 13:11:25,259 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:25,259 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:25,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 887647737, now seen corresponding path program 1 times
[2025-03-08 13:11:25,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:25,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622555000]
[2025-03-08 13:11:25,260 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:25,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:25,277 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:11:25,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:11:25,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:25,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:25,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:25,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:25,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622555000]
[2025-03-08 13:11:25,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622555000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:25,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:25,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:25,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905274120]
[2025-03-08 13:11:25,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:25,415 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:25,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:25,416 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:25,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:25,418 INFO  L87              Difference]: Start difference. First operand 495 states and 786 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:25,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:25,523 INFO  L93              Difference]: Finished difference Result 1455 states and 2320 transitions.
[2025-03-08 13:11:25,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:25,524 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223
[2025-03-08 13:11:25,527 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:25,531 INFO  L225             Difference]: With dead ends: 1455
[2025-03-08 13:11:25,532 INFO  L226             Difference]: Without dead ends: 963
[2025-03-08 13:11:25,533 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:25,534 INFO  L435           NwaCegarLoop]: 304 mSDtfsCounter, 169 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:25,534 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 457 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:11:25,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2025-03-08 13:11:25,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961.
[2025-03-08 13:11:25,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 961 states, 680 states have (on average 1.4352941176470588) internal successors, (976), 680 states have internal predecessors, (976), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272)
[2025-03-08 13:11:25,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1520 transitions.
[2025-03-08 13:11:25,615 INFO  L78                 Accepts]: Start accepts. Automaton has 961 states and 1520 transitions. Word has length 223
[2025-03-08 13:11:25,615 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:25,615 INFO  L471      AbstractCegarLoop]: Abstraction has 961 states and 1520 transitions.
[2025-03-08 13:11:25,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:25,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 961 states and 1520 transitions.
[2025-03-08 13:11:25,617 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-08 13:11:25,617 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:25,617 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:25,617 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 13:11:25,618 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:25,618 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:25,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1678583575, now seen corresponding path program 1 times
[2025-03-08 13:11:25,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:25,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954945060]
[2025-03-08 13:11:25,618 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:25,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:25,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-08 13:11:25,659 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-08 13:11:25,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:25,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:25,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:25,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:25,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954945060]
[2025-03-08 13:11:25,795 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954945060] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:25,795 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:25,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:11:25,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163405289]
[2025-03-08 13:11:25,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:25,795 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:11:25,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:25,796 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:11:25,796 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:11:25,796 INFO  L87              Difference]: Start difference. First operand 961 states and 1520 transitions. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:26,360 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:26,360 INFO  L93              Difference]: Finished difference Result 3837 states and 6084 transitions.
[2025-03-08 13:11:26,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:11:26,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224
[2025-03-08 13:11:26,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:26,375 INFO  L225             Difference]: With dead ends: 3837
[2025-03-08 13:11:26,375 INFO  L226             Difference]: Without dead ends: 2879
[2025-03-08 13:11:26,379 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:26,379 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 487 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:26,380 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 359 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 13:11:26,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2879 states.
[2025-03-08 13:11:26,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1917.
[2025-03-08 13:11:26,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1917 states, 1356 states have (on average 1.4306784660766962) internal successors, (1940), 1356 states have internal predecessors, (1940), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 544 states have call predecessors, (544), 544 states have call successors, (544)
[2025-03-08 13:11:26,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3028 transitions.
[2025-03-08 13:11:26,531 INFO  L78                 Accepts]: Start accepts. Automaton has 1917 states and 3028 transitions. Word has length 224
[2025-03-08 13:11:26,531 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:26,531 INFO  L471      AbstractCegarLoop]: Abstraction has 1917 states and 3028 transitions.
[2025-03-08 13:11:26,531 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:26,532 INFO  L276                IsEmpty]: Start isEmpty. Operand 1917 states and 3028 transitions.
[2025-03-08 13:11:26,533 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-08 13:11:26,534 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:26,534 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:26,534 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 13:11:26,534 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:26,535 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:26,535 INFO  L85        PathProgramCache]: Analyzing trace with hash 1365534352, now seen corresponding path program 1 times
[2025-03-08 13:11:26,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:26,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409648317]
[2025-03-08 13:11:26,535 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:26,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:26,550 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-08 13:11:26,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-08 13:11:26,568 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:26,568 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:26,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:26,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:26,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409648317]
[2025-03-08 13:11:26,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409648317] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:26,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:26,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:26,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774962953]
[2025-03-08 13:11:26,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:26,683 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:26,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:26,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:26,683 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:26,683 INFO  L87              Difference]: Start difference. First operand 1917 states and 3028 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:26,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:26,927 INFO  L93              Difference]: Finished difference Result 5745 states and 9078 transitions.
[2025-03-08 13:11:26,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:26,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225
[2025-03-08 13:11:26,928 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:26,947 INFO  L225             Difference]: With dead ends: 5745
[2025-03-08 13:11:26,947 INFO  L226             Difference]: Without dead ends: 3831
[2025-03-08 13:11:26,953 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:26,954 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 128 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:26,954 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 341 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:11:26,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3831 states.
[2025-03-08 13:11:27,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3813.
[2025-03-08 13:11:27,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3813 states, 2692 states have (on average 1.4279346210995543) internal successors, (3844), 2692 states have internal predecessors, (3844), 1088 states have call successors, (1088), 32 states have call predecessors, (1088), 32 states have return successors, (1088), 1088 states have call predecessors, (1088), 1088 states have call successors, (1088)
[2025-03-08 13:11:27,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6020 transitions.
[2025-03-08 13:11:27,218 INFO  L78                 Accepts]: Start accepts. Automaton has 3813 states and 6020 transitions. Word has length 225
[2025-03-08 13:11:27,218 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:27,218 INFO  L471      AbstractCegarLoop]: Abstraction has 3813 states and 6020 transitions.
[2025-03-08 13:11:27,219 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:27,219 INFO  L276                IsEmpty]: Start isEmpty. Operand 3813 states and 6020 transitions.
[2025-03-08 13:11:27,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-08 13:11:27,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:27,222 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:27,222 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 13:11:27,222 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:27,223 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:27,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 921412474, now seen corresponding path program 1 times
[2025-03-08 13:11:27,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:27,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52686086]
[2025-03-08 13:11:27,223 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:27,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:27,241 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 13:11:27,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 13:11:27,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:27,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:27,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:27,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:27,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52686086]
[2025-03-08 13:11:27,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52686086] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:27,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:27,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:27,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325340274]
[2025-03-08 13:11:27,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:27,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:27,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:27,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:27,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:27,378 INFO  L87              Difference]: Start difference. First operand 3813 states and 6020 transitions. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:27,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:27,695 INFO  L93              Difference]: Finished difference Result 9577 states and 15142 transitions.
[2025-03-08 13:11:27,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:27,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226
[2025-03-08 13:11:27,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:27,724 INFO  L225             Difference]: With dead ends: 9577
[2025-03-08 13:11:27,725 INFO  L226             Difference]: Without dead ends: 5767
[2025-03-08 13:11:27,736 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:27,737 INFO  L435           NwaCegarLoop]: 207 mSDtfsCounter, 122 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:27,737 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 358 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:11:27,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5767 states.
[2025-03-08 13:11:28,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5765.
[2025-03-08 13:11:28,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5765 states, 4084 states have (on average 1.4191968658178256) internal successors, (5796), 4084 states have internal predecessors, (5796), 1632 states have call successors, (1632), 48 states have call predecessors, (1632), 48 states have return successors, (1632), 1632 states have call predecessors, (1632), 1632 states have call successors, (1632)
[2025-03-08 13:11:28,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9060 transitions.
[2025-03-08 13:11:28,096 INFO  L78                 Accepts]: Start accepts. Automaton has 5765 states and 9060 transitions. Word has length 226
[2025-03-08 13:11:28,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:28,097 INFO  L471      AbstractCegarLoop]: Abstraction has 5765 states and 9060 transitions.
[2025-03-08 13:11:28,097 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:28,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 5765 states and 9060 transitions.
[2025-03-08 13:11:28,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-08 13:11:28,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:28,099 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:28,100 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 13:11:28,100 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:28,100 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:28,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -18068683, now seen corresponding path program 1 times
[2025-03-08 13:11:28,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:28,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683235223]
[2025-03-08 13:11:28,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:28,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:28,112 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-08 13:11:28,127 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-08 13:11:28,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:28,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:28,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:28,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:28,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683235223]
[2025-03-08 13:11:28,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683235223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:28,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:28,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:11:28,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969676318]
[2025-03-08 13:11:28,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:28,347 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:11:28,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:28,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:11:28,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:28,347 INFO  L87              Difference]: Start difference. First operand 5765 states and 9060 transitions. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:29,473 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:29,474 INFO  L93              Difference]: Finished difference Result 19323 states and 30385 transitions.
[2025-03-08 13:11:29,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 13:11:29,474 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-08 13:11:29,475 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:29,532 INFO  L225             Difference]: With dead ends: 19323
[2025-03-08 13:11:29,533 INFO  L226             Difference]: Without dead ends: 13561
[2025-03-08 13:11:29,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-08 13:11:29,549 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 544 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:29,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 654 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 13:11:29,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13561 states.
[2025-03-08 13:11:30,015 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 7743.
[2025-03-08 13:11:30,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7743 states, 5586 states have (on average 1.4278553526673827) internal successors, (7976), 5614 states have internal predecessors, (7976), 2084 states have call successors, (2084), 72 states have call predecessors, (2084), 72 states have return successors, (2084), 2056 states have call predecessors, (2084), 2084 states have call successors, (2084)
[2025-03-08 13:11:30,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 12144 transitions.
[2025-03-08 13:11:30,066 INFO  L78                 Accepts]: Start accepts. Automaton has 7743 states and 12144 transitions. Word has length 228
[2025-03-08 13:11:30,066 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:30,066 INFO  L471      AbstractCegarLoop]: Abstraction has 7743 states and 12144 transitions.
[2025-03-08 13:11:30,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:30,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 7743 states and 12144 transitions.
[2025-03-08 13:11:30,073 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-08 13:11:30,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:30,073 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:30,073 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 13:11:30,074 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:30,074 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:30,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -2095278026, now seen corresponding path program 1 times
[2025-03-08 13:11:30,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:30,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690932122]
[2025-03-08 13:11:30,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:30,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:30,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-08 13:11:30,104 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-08 13:11:30,105 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:30,105 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:30,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:30,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:30,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690932122]
[2025-03-08 13:11:30,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690932122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:30,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:30,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 13:11:30,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822278892]
[2025-03-08 13:11:30,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:30,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 13:11:30,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:30,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 13:11:30,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 13:11:30,289 INFO  L87              Difference]: Start difference. First operand 7743 states and 12144 transitions. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:31,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:31,362 INFO  L93              Difference]: Finished difference Result 21303 states and 33348 transitions.
[2025-03-08 13:11:31,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:11:31,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-08 13:11:31,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:31,412 INFO  L225             Difference]: With dead ends: 21303
[2025-03-08 13:11:31,413 INFO  L226             Difference]: Without dead ends: 13563
[2025-03-08 13:11:31,432 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-08 13:11:31,433 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 182 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:31,433 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 536 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:11:31,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13563 states.
[2025-03-08 13:11:32,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13563 to 13497.
[2025-03-08 13:11:32,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13497 states, 9744 states have (on average 1.423440065681445) internal successors, (13870), 9800 states have internal predecessors, (13870), 3624 states have call successors, (3624), 128 states have call predecessors, (3624), 128 states have return successors, (3624), 3568 states have call predecessors, (3624), 3624 states have call successors, (3624)
[2025-03-08 13:11:32,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 21118 transitions.
[2025-03-08 13:11:32,191 INFO  L78                 Accepts]: Start accepts. Automaton has 13497 states and 21118 transitions. Word has length 228
[2025-03-08 13:11:32,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:32,192 INFO  L471      AbstractCegarLoop]: Abstraction has 13497 states and 21118 transitions.
[2025-03-08 13:11:32,193 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:32,193 INFO  L276                IsEmpty]: Start isEmpty. Operand 13497 states and 21118 transitions.
[2025-03-08 13:11:32,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-08 13:11:32,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:32,197 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:32,197 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 13:11:32,197 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:32,198 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:32,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 1451954326, now seen corresponding path program 1 times
[2025-03-08 13:11:32,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:32,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353299422]
[2025-03-08 13:11:32,198 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:32,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:32,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-08 13:11:32,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-08 13:11:32,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:32,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:32,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:32,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:32,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353299422]
[2025-03-08 13:11:32,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353299422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:32,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:32,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:11:32,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694529866]
[2025-03-08 13:11:32,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:32,371 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:11:32,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:32,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:11:32,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:32,371 INFO  L87              Difference]: Start difference. First operand 13497 states and 21118 transitions. Second operand  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:33,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:33,172 INFO  L93              Difference]: Finished difference Result 29901 states and 46748 transitions.
[2025-03-08 13:11:33,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:11:33,173 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-08 13:11:33,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:33,249 INFO  L225             Difference]: With dead ends: 29901
[2025-03-08 13:11:33,249 INFO  L226             Difference]: Without dead ends: 16407
[2025-03-08 13:11:33,282 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:11:33,283 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 124 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:33,283 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 350 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:11:33,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16407 states.
[2025-03-08 13:11:34,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16407 to 16381.
[2025-03-08 13:11:34,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16381 states, 11830 states have (on average 1.4204564666103128) internal successors, (16804), 11900 states have internal predecessors, (16804), 4394 states have call successors, (4394), 156 states have call predecessors, (4394), 156 states have return successors, (4394), 4324 states have call predecessors, (4394), 4394 states have call successors, (4394)
[2025-03-08 13:11:34,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16381 states to 16381 states and 25592 transitions.
[2025-03-08 13:11:34,551 INFO  L78                 Accepts]: Start accepts. Automaton has 16381 states and 25592 transitions. Word has length 228
[2025-03-08 13:11:34,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:34,552 INFO  L471      AbstractCegarLoop]: Abstraction has 16381 states and 25592 transitions.
[2025-03-08 13:11:34,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:34,552 INFO  L276                IsEmpty]: Start isEmpty. Operand 16381 states and 25592 transitions.
[2025-03-08 13:11:34,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-03-08 13:11:34,554 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:34,555 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:34,555 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 13:11:34,555 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:34,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:34,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059749755, now seen corresponding path program 1 times
[2025-03-08 13:11:34,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:34,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922580545]
[2025-03-08 13:11:34,556 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:34,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:34,566 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-08 13:11:34,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-08 13:11:34,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:34,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:34,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-08 13:11:34,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:34,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922580545]
[2025-03-08 13:11:34,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922580545] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:11:34,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124488171]
[2025-03-08 13:11:34,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:34,746 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:11:34,746 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:11:34,749 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:11:34,750 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 13:11:34,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-08 13:11:34,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-08 13:11:34,869 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:34,869 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:34,872 INFO  L256         TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 13:11:34,878 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:11:35,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2025-03-08 13:11:35,078 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:11:35,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-08 13:11:35,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124488171] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 13:11:35,326 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 13:11:35,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-03-08 13:11:35,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508446100]
[2025-03-08 13:11:35,327 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:11:35,327 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 13:11:35,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:35,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 13:11:35,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2025-03-08 13:11:35,328 INFO  L87              Difference]: Start difference. First operand 16381 states and 25592 transitions. Second operand  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-08 13:11:36,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:36,480 INFO  L93              Difference]: Finished difference Result 31155 states and 47970 transitions.
[2025-03-08 13:11:36,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 13:11:36,481 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 229
[2025-03-08 13:11:36,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:36,549 INFO  L225             Difference]: With dead ends: 31155
[2025-03-08 13:11:36,550 INFO  L226             Difference]: Without dead ends: 14777
[2025-03-08 13:11:36,584 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240
[2025-03-08 13:11:36,585 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 520 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:36,585 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 563 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 13:11:36,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14777 states.
[2025-03-08 13:11:37,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14777 to 13443.
[2025-03-08 13:11:37,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13443 states, 9688 states have (on average 1.398431048720066) internal successors, (13548), 9716 states have internal predecessors, (13548), 3512 states have call successors, (3512), 242 states have call predecessors, (3512), 242 states have return successors, (3512), 3484 states have call predecessors, (3512), 3512 states have call successors, (3512)
[2025-03-08 13:11:37,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13443 states to 13443 states and 20572 transitions.
[2025-03-08 13:11:37,507 INFO  L78                 Accepts]: Start accepts. Automaton has 13443 states and 20572 transitions. Word has length 229
[2025-03-08 13:11:37,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:37,508 INFO  L471      AbstractCegarLoop]: Abstraction has 13443 states and 20572 transitions.
[2025-03-08 13:11:37,508 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-08 13:11:37,508 INFO  L276                IsEmpty]: Start isEmpty. Operand 13443 states and 20572 transitions.
[2025-03-08 13:11:37,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-08 13:11:37,510 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:37,510 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:37,518 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 13:11:37,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-08 13:11:37,711 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:37,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:37,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -1573560555, now seen corresponding path program 1 times
[2025-03-08 13:11:37,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:37,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414404326]
[2025-03-08 13:11:37,713 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:37,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:37,724 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-08 13:11:37,737 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-08 13:11:37,737 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:37,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:37,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:37,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:37,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414404326]
[2025-03-08 13:11:37,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414404326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:37,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:37,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:11:37,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875311]
[2025-03-08 13:11:37,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:37,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:11:37,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:37,937 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:11:37,937 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:37,937 INFO  L87              Difference]: Start difference. First operand 13443 states and 20572 transitions. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:38,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:38,894 INFO  L93              Difference]: Finished difference Result 27439 states and 42001 transitions.
[2025-03-08 13:11:38,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:11:38,895 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 230
[2025-03-08 13:11:38,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:38,959 INFO  L225             Difference]: With dead ends: 27439
[2025-03-08 13:11:38,959 INFO  L226             Difference]: Without dead ends: 13999
[2025-03-08 13:11:38,989 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-08 13:11:38,990 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 319 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:38,990 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 553 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 13:11:38,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13999 states.
[2025-03-08 13:11:40,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13999 to 13909.
[2025-03-08 13:11:40,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13909 states, 9978 states have (on average 1.3916616556424133) internal successors, (13886), 10014 states have internal predecessors, (13886), 3680 states have call successors, (3680), 250 states have call predecessors, (3680), 250 states have return successors, (3680), 3644 states have call predecessors, (3680), 3680 states have call successors, (3680)
[2025-03-08 13:11:40,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 21246 transitions.
[2025-03-08 13:11:40,237 INFO  L78                 Accepts]: Start accepts. Automaton has 13909 states and 21246 transitions. Word has length 230
[2025-03-08 13:11:40,237 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:40,237 INFO  L471      AbstractCegarLoop]: Abstraction has 13909 states and 21246 transitions.
[2025-03-08 13:11:40,237 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:40,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 13909 states and 21246 transitions.
[2025-03-08 13:11:40,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 13:11:40,239 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:40,239 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:40,240 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 13:11:40,240 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:40,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:40,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 1392491386, now seen corresponding path program 1 times
[2025-03-08 13:11:40,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:40,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579866824]
[2025-03-08 13:11:40,241 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:40,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:40,255 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 13:11:40,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 13:11:40,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:40,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:40,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:40,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:40,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579866824]
[2025-03-08 13:11:40,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579866824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:40,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:40,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:11:40,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602138510]
[2025-03-08 13:11:40,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:40,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:11:40,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:40,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:11:40,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:40,625 INFO  L87              Difference]: Start difference. First operand 13909 states and 21246 transitions. Second operand  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:42,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:42,781 INFO  L93              Difference]: Finished difference Result 45449 states and 69269 transitions.
[2025-03-08 13:11:42,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 13:11:42,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231
[2025-03-08 13:11:42,782 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:42,911 INFO  L225             Difference]: With dead ends: 45449
[2025-03-08 13:11:42,912 INFO  L226             Difference]: Without dead ends: 31543
[2025-03-08 13:11:42,956 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:11:42,956 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 613 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:42,957 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 687 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 13:11:42,979 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31543 states.
[2025-03-08 13:11:44,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31543 to 23235.
[2025-03-08 13:11:44,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23235 states, 16880 states have (on average 1.3954383886255923) internal successors, (23555), 16950 states have internal predecessors, (23555), 5958 states have call successors, (5958), 396 states have call predecessors, (5958), 396 states have return successors, (5958), 5888 states have call predecessors, (5958), 5958 states have call successors, (5958)
[2025-03-08 13:11:44,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23235 states to 23235 states and 35471 transitions.
[2025-03-08 13:11:44,510 INFO  L78                 Accepts]: Start accepts. Automaton has 23235 states and 35471 transitions. Word has length 231
[2025-03-08 13:11:44,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:44,510 INFO  L471      AbstractCegarLoop]: Abstraction has 23235 states and 35471 transitions.
[2025-03-08 13:11:44,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:44,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 23235 states and 35471 transitions.
[2025-03-08 13:11:44,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 13:11:44,512 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:44,512 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:44,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 13:11:44,512 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:44,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:44,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 519497817, now seen corresponding path program 1 times
[2025-03-08 13:11:44,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:44,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4047122]
[2025-03-08 13:11:44,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:44,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:44,522 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 13:11:44,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 13:11:44,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:44,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:45,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked.
[2025-03-08 13:11:45,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:45,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4047122]
[2025-03-08 13:11:45,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4047122] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:11:45,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763451703]
[2025-03-08 13:11:45,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:45,305 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:11:45,305 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:11:45,307 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:11:45,308 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 13:11:45,369 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 13:11:45,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 13:11:45,418 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:45,418 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:45,421 INFO  L256         TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-08 13:11:45,425 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:11:46,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1222 proven. 249 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked.
[2025-03-08 13:11:46,865 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:11:48,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 111 proven. 267 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked.
[2025-03-08 13:11:48,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763451703] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 13:11:48,079 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 13:11:48,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35
[2025-03-08 13:11:48,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428903842]
[2025-03-08 13:11:48,079 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:11:48,079 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2025-03-08 13:11:48,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:48,080 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2025-03-08 13:11:48,080 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190
[2025-03-08 13:11:48,081 INFO  L87              Difference]: Start difference. First operand 23235 states and 35471 transitions. Second operand  has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90)
[2025-03-08 13:11:50,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:50,524 INFO  L93              Difference]: Finished difference Result 38299 states and 55848 transitions.
[2025-03-08 13:11:50,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-03-08 13:11:50,525 INFO  L78                 Accepts]: Start accepts. Automaton has  has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90) Word has length 231
[2025-03-08 13:11:50,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:50,600 INFO  L225             Difference]: With dead ends: 38299
[2025-03-08 13:11:50,601 INFO  L226             Difference]: Without dead ends: 20083
[2025-03-08 13:11:50,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1073, Invalid=2709, Unknown=0, NotChecked=0, Total=3782
[2025-03-08 13:11:50,639 INFO  L435           NwaCegarLoop]: 129 mSDtfsCounter, 421 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:50,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 493 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 13:11:50,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20083 states.
[2025-03-08 13:11:52,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20083 to 18520.
[2025-03-08 13:11:52,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18520 states, 13768 states have (on average 1.3284427658338176) internal successors, (18290), 13873 states have internal predecessors, (18290), 3850 states have call successors, (3850), 901 states have call predecessors, (3850), 901 states have return successors, (3850), 3745 states have call predecessors, (3850), 3850 states have call successors, (3850)
[2025-03-08 13:11:52,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18520 states to 18520 states and 25990 transitions.
[2025-03-08 13:11:52,130 INFO  L78                 Accepts]: Start accepts. Automaton has 18520 states and 25990 transitions. Word has length 231
[2025-03-08 13:11:52,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:52,130 INFO  L471      AbstractCegarLoop]: Abstraction has 18520 states and 25990 transitions.
[2025-03-08 13:11:52,131 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90)
[2025-03-08 13:11:52,131 INFO  L276                IsEmpty]: Start isEmpty. Operand 18520 states and 25990 transitions.
[2025-03-08 13:11:52,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-08 13:11:52,132 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:52,132 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:52,139 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 13:11:52,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:11:52,333 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:52,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:52,334 INFO  L85        PathProgramCache]: Analyzing trace with hash 83635760, now seen corresponding path program 1 times
[2025-03-08 13:11:52,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:52,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845923791]
[2025-03-08 13:11:52,334 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:52,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:52,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-08 13:11:52,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-08 13:11:52,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:52,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:52,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:52,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:52,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845923791]
[2025-03-08 13:11:52,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845923791] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:52,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:52,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:11:52,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958735137]
[2025-03-08 13:11:52,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:52,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:11:52,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:52,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:11:52,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:52,467 INFO  L87              Difference]: Start difference. First operand 18520 states and 25990 transitions. Second operand  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:54,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:54,262 INFO  L93              Difference]: Finished difference Result 29138 states and 40998 transitions.
[2025-03-08 13:11:54,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:11:54,262 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232
[2025-03-08 13:11:54,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:54,333 INFO  L225             Difference]: With dead ends: 29138
[2025-03-08 13:11:54,333 INFO  L226             Difference]: Without dead ends: 22496
[2025-03-08 13:11:54,352 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:11:54,352 INFO  L435           NwaCegarLoop]: 195 mSDtfsCounter, 186 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:54,352 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 543 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:11:54,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22496 states.
[2025-03-08 13:11:56,490 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22496 to 22470.
[2025-03-08 13:11:56,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22470 states, 16656 states have (on average 1.3282901056676273) internal successors, (22124), 16779 states have internal predecessors, (22124), 4708 states have call successors, (4708), 1105 states have call predecessors, (4708), 1105 states have return successors, (4708), 4585 states have call predecessors, (4708), 4708 states have call successors, (4708)
[2025-03-08 13:11:56,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22470 states to 22470 states and 31540 transitions.
[2025-03-08 13:11:56,575 INFO  L78                 Accepts]: Start accepts. Automaton has 22470 states and 31540 transitions. Word has length 232
[2025-03-08 13:11:56,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:11:56,576 INFO  L471      AbstractCegarLoop]: Abstraction has 22470 states and 31540 transitions.
[2025-03-08 13:11:56,576 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:56,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 22470 states and 31540 transitions.
[2025-03-08 13:11:56,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-08 13:11:56,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:11:56,578 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:11:56,578 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 13:11:56,578 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:11:56,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:11:56,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -186917513, now seen corresponding path program 1 times
[2025-03-08 13:11:56,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:11:56,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210123346]
[2025-03-08 13:11:56,578 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:11:56,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:11:56,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-08 13:11:56,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-08 13:11:56,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:11:56,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:11:56,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:11:56,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:11:56,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210123346]
[2025-03-08 13:11:56,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210123346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:11:56,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:11:56,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:11:56,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181770658]
[2025-03-08 13:11:56,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:11:56,734 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:11:56,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:11:56,735 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:11:56,735 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:11:56,735 INFO  L87              Difference]: Start difference. First operand 22470 states and 31540 transitions. Second operand  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:11:58,616 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:11:58,616 INFO  L93              Difference]: Finished difference Result 39966 states and 56289 transitions.
[2025-03-08 13:11:58,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:11:58,617 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232
[2025-03-08 13:11:58,617 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:11:58,694 INFO  L225             Difference]: With dead ends: 39966
[2025-03-08 13:11:58,694 INFO  L226             Difference]: Without dead ends: 24024
[2025-03-08 13:11:58,731 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:11:58,732 INFO  L435           NwaCegarLoop]: 190 mSDtfsCounter, 289 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:11:58,732 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 673 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:11:58,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24024 states.
[2025-03-08 13:12:00,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24024 to 22868.
[2025-03-08 13:12:00,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22868 states, 17054 states have (on average 1.3328837809311598) internal successors, (22731), 17177 states have internal predecessors, (22731), 4708 states have call successors, (4708), 1105 states have call predecessors, (4708), 1105 states have return successors, (4708), 4585 states have call predecessors, (4708), 4708 states have call successors, (4708)
[2025-03-08 13:12:00,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22868 states to 22868 states and 32147 transitions.
[2025-03-08 13:12:00,645 INFO  L78                 Accepts]: Start accepts. Automaton has 22868 states and 32147 transitions. Word has length 232
[2025-03-08 13:12:00,645 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:12:00,645 INFO  L471      AbstractCegarLoop]: Abstraction has 22868 states and 32147 transitions.
[2025-03-08 13:12:00,645 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-08 13:12:00,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 22868 states and 32147 transitions.
[2025-03-08 13:12:00,646 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-08 13:12:00,646 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:12:00,646 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:12:00,646 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 13:12:00,647 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:12:00,647 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:12:00,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -247279476, now seen corresponding path program 1 times
[2025-03-08 13:12:00,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:12:00,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107705765]
[2025-03-08 13:12:00,647 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:00,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:12:00,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-08 13:12:00,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-08 13:12:00,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:00,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:12:01,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:12:01,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:12:01,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107705765]
[2025-03-08 13:12:01,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107705765] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:12:01,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:12:01,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 13:12:01,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550127986]
[2025-03-08 13:12:01,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:12:01,133 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 13:12:01,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:12:01,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 13:12:01,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 13:12:01,134 INFO  L87              Difference]: Start difference. First operand 22868 states and 32147 transitions. Second operand  has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:03,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:12:03,929 INFO  L93              Difference]: Finished difference Result 51129 states and 71789 transitions.
[2025-03-08 13:12:03,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 13:12:03,930 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 232
[2025-03-08 13:12:03,930 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:12:04,029 INFO  L225             Difference]: With dead ends: 51129
[2025-03-08 13:12:04,029 INFO  L226             Difference]: Without dead ends: 28264
[2025-03-08 13:12:04,075 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2025-03-08 13:12:04,076 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 675 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 13:12:04,076 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 675 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 13:12:04,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28264 states.
[2025-03-08 13:12:06,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28264 to 28167.
[2025-03-08 13:12:06,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28167 states, 21021 states have (on average 1.3273393273393272) internal successors, (27902), 21182 states have internal predecessors, (27902), 5784 states have call successors, (5784), 1361 states have call predecessors, (5784), 1361 states have return successors, (5784), 5623 states have call predecessors, (5784), 5784 states have call successors, (5784)
[2025-03-08 13:12:06,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28167 states to 28167 states and 39470 transitions.
[2025-03-08 13:12:07,007 INFO  L78                 Accepts]: Start accepts. Automaton has 28167 states and 39470 transitions. Word has length 232
[2025-03-08 13:12:07,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:12:07,008 INFO  L471      AbstractCegarLoop]: Abstraction has 28167 states and 39470 transitions.
[2025-03-08 13:12:07,008 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:07,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 28167 states and 39470 transitions.
[2025-03-08 13:12:07,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 13:12:07,010 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:12:07,010 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:12:07,010 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 13:12:07,010 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:12:07,010 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:12:07,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045964804, now seen corresponding path program 1 times
[2025-03-08 13:12:07,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:12:07,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934883180]
[2025-03-08 13:12:07,011 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:07,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:12:07,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 13:12:07,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 13:12:07,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:07,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:12:07,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-08 13:12:07,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:12:07,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934883180]
[2025-03-08 13:12:07,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934883180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:12:07,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:12:07,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 13:12:07,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438115279]
[2025-03-08 13:12:07,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:12:07,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 13:12:07,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:12:07,510 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 13:12:07,510 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-08 13:12:07,510 INFO  L87              Difference]: Start difference. First operand 28167 states and 39470 transitions. Second operand  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:10,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:12:10,687 INFO  L93              Difference]: Finished difference Result 50670 states and 71029 transitions.
[2025-03-08 13:12:10,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 13:12:10,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 233
[2025-03-08 13:12:10,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:12:10,778 INFO  L225             Difference]: With dead ends: 50670
[2025-03-08 13:12:10,778 INFO  L226             Difference]: Without dead ends: 30516
[2025-03-08 13:12:10,813 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342
[2025-03-08 13:12:10,814 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 402 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 13:12:10,814 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1289 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 13:12:10,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30516 states.
[2025-03-08 13:12:14,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30516 to 28855.
[2025-03-08 13:12:14,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28855 states, 21629 states have (on average 1.3270146562485552) internal successors, (28702), 21806 states have internal predecessors, (28702), 5848 states have call successors, (5848), 1377 states have call predecessors, (5848), 1377 states have return successors, (5848), 5671 states have call predecessors, (5848), 5848 states have call successors, (5848)
[2025-03-08 13:12:14,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28855 states to 28855 states and 40398 transitions.
[2025-03-08 13:12:14,238 INFO  L78                 Accepts]: Start accepts. Automaton has 28855 states and 40398 transitions. Word has length 233
[2025-03-08 13:12:14,238 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:12:14,239 INFO  L471      AbstractCegarLoop]: Abstraction has 28855 states and 40398 transitions.
[2025-03-08 13:12:14,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:14,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 28855 states and 40398 transitions.
[2025-03-08 13:12:14,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 13:12:14,243 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:12:14,243 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:12:14,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 13:12:14,243 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:12:14,243 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:12:14,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -42725397, now seen corresponding path program 1 times
[2025-03-08 13:12:14,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:12:14,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179907519]
[2025-03-08 13:12:14,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:14,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:12:14,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 13:12:14,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 13:12:14,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:14,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 13:12:14,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314617248]
[2025-03-08 13:12:14,299 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:14,299 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:12:14,299 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:12:14,301 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:12:14,303 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 13:12:14,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 13:12:14,434 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 13:12:14,434 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:14,434 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:12:14,438 INFO  L256         TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-03-08 13:12:14,442 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:12:15,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2025-03-08 13:12:15,136 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:12:34,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:12:34,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179907519]
[2025-03-08 13:12:34,067 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-03-08 13:12:34,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314617248]
[2025-03-08 13:12:34,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314617248] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:12:34,067 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-03-08 13:12:34,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2025-03-08 13:12:34,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707022169]
[2025-03-08 13:12:34,068 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:12:34,068 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 13:12:34,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:12:34,068 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 13:12:34,068 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=126, Unknown=4, NotChecked=0, Total=182
[2025-03-08 13:12:34,068 INFO  L87              Difference]: Start difference. First operand 28855 states and 40398 transitions. Second operand  has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:41,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:12:41,949 INFO  L93              Difference]: Finished difference Result 62261 states and 86704 transitions.
[2025-03-08 13:12:41,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 13:12:41,949 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 233
[2025-03-08 13:12:41,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:12:42,050 INFO  L225             Difference]: With dead ends: 62261
[2025-03-08 13:12:42,050 INFO  L226             Difference]: Without dead ends: 33409
[2025-03-08 13:12:42,093 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=117, Invalid=259, Unknown=4, NotChecked=0, Total=380
[2025-03-08 13:12:42,093 INFO  L435           NwaCegarLoop]: 203 mSDtfsCounter, 457 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:12:42,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 909 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time]
[2025-03-08 13:12:42,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33409 states.
[2025-03-08 13:12:44,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33409 to 30197.
[2025-03-08 13:12:44,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30197 states, 22859 states have (on average 1.3318167898858218) internal successors, (30444), 23052 states have internal predecessors, (30444), 5944 states have call successors, (5944), 1393 states have call predecessors, (5944), 1393 states have return successors, (5944), 5751 states have call predecessors, (5944), 5944 states have call successors, (5944)
[2025-03-08 13:12:44,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30197 states to 30197 states and 42332 transitions.
[2025-03-08 13:12:44,918 INFO  L78                 Accepts]: Start accepts. Automaton has 30197 states and 42332 transitions. Word has length 233
[2025-03-08 13:12:44,918 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:12:44,918 INFO  L471      AbstractCegarLoop]: Abstraction has 30197 states and 42332 transitions.
[2025-03-08 13:12:44,918 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-08 13:12:44,918 INFO  L276                IsEmpty]: Start isEmpty. Operand 30197 states and 42332 transitions.
[2025-03-08 13:12:44,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 13:12:44,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:12:44,921 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:12:44,928 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 13:12:45,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:12:45,122 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:12:45,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:12:45,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 982766602, now seen corresponding path program 1 times
[2025-03-08 13:12:45,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:12:45,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269651671]
[2025-03-08 13:12:45,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:45,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:12:45,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 13:12:45,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 13:12:45,204 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:45,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 13:12:45,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715622441]
[2025-03-08 13:12:45,206 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:12:45,206 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:12:45,206 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:12:45,208 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:12:45,209 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 13:12:45,284 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 13:12:45,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 13:12:45,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:12:45,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 13:12:45,444 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.