./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3
[2025-02-05 16:18:55,862 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:18:55,868 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:18:55,870 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:18:55,872 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:18:55,873 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:18:55,873 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:57,064 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cde7bbead/dd4c353eb00d4819af59ab2f797ecabd/FLAG815be0b68
[2025-02-05 16:18:57,380 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:18:57,383 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:57,398 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cde7bbead/dd4c353eb00d4819af59ab2f797ecabd/FLAG815be0b68
[2025-02-05 16:18:57,660 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cde7bbead/dd4c353eb00d4819af59ab2f797ecabd
[2025-02-05 16:18:57,662 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:18:57,664 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:18:57,666 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:57,667 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:18:57,673 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:18:57,674 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:57,675 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57, skipping insertion in model container
[2025-02-05 16:18:57,677 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:57,701 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:18:57,906 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522]
[2025-02-05 16:18:57,908 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:57,920 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:18:57,967 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522]
[2025-02-05 16:18:57,968 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:57,979 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:18:57,980 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57 WrapperNode
[2025-02-05 16:18:57,980 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:57,981 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:57,981 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:18:57,981 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:18:57,985 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:57,992 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,027 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 493
[2025-02-05 16:18:58,027 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:58,028 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:18:58,028 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:18:58,028 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:18:58,043 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,044 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,051 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,073 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 16:18:58,073 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,073 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,087 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,091 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,092 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,096 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,098 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:18:58,102 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:18:58,102 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:18:58,102 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:18:58,103 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (1/1) ...
[2025-02-05 16:18:58,109 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:18:58,119 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:18:58,132 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 16:18:58,146 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 16:18:58,162 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:18:58,163 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:18:58,163 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:18:58,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:18:58,246 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:18:58,247 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:18:58,699 INFO  L?                        ?]: Removed 48 outVars from TransFormulas that were not future-live.
[2025-02-05 16:18:58,699 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:18:58,707 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:18:58,707 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:18:58,708 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:58 BoogieIcfgContainer
[2025-02-05 16:18:58,708 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:18:58,709 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:18:58,709 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:18:58,713 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:18:58,713 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:18:57" (1/3) ...
[2025-02-05 16:18:58,713 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d662462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:58, skipping insertion in model container
[2025-02-05 16:18:58,713 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:57" (2/3) ...
[2025-02-05 16:18:58,714 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d662462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:58, skipping insertion in model container
[2025-02-05 16:18:58,714 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:58" (3/3) ...
[2025-02-05 16:18:58,715 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:58,724 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:18:58,726 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:18:58,778 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:18:58,798 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;@67209acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:18:58,798 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:18:58,806 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:58,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:18:58,815 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:58,816 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:58,816 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:58,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:58,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452200164, now seen corresponding path program 1 times
[2025-02-05 16:18:58,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:58,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565737012]
[2025-02-05 16:18:58,827 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:58,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:58,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:18:58,942 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:18:58,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:58,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:59,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:59,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:59,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565737012]
[2025-02-05 16:18:59,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565737012] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:59,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:59,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:18:59,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935289871]
[2025-02-05 16:18:59,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:59,083 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:18:59,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:59,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:18:59,109 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:18:59,111 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:59,132 INFO  L93              Difference]: Finished difference Result 210 states and 364 transitions.
[2025-02-05 16:18:59,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:18:59,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-02-05 16:18:59,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:59,141 INFO  L225             Difference]: With dead ends: 210
[2025-02-05 16:18:59,142 INFO  L226             Difference]: Without dead ends: 133
[2025-02-05 16:18:59,144 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-05 16:18:59,147 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:59,147 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:59,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-02-05 16:18:59,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-02-05 16:18:59,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions.
[2025-02-05 16:18:59,177 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37
[2025-02-05 16:18:59,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:59,178 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 232 transitions.
[2025-02-05 16:18:59,178 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,178 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions.
[2025-02-05 16:18:59,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:18:59,179 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:59,179 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:59,179 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:18:59,180 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:59,180 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:59,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 1043375939, now seen corresponding path program 1 times
[2025-02-05 16:18:59,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:59,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005674254]
[2025-02-05 16:18:59,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:59,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:59,202 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:18:59,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:18:59,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:59,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:59,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:59,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:59,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005674254]
[2025-02-05 16:18:59,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005674254] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:59,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:59,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:59,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097351080]
[2025-02-05 16:18:59,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:59,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:59,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:59,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:59,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:59,491 INFO  L87              Difference]: Start difference. First operand 133 states and 232 transitions. Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:59,585 INFO  L93              Difference]: Finished difference Result 210 states and 360 transitions.
[2025-02-05 16:18:59,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:59,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-02-05 16:18:59,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:59,588 INFO  L225             Difference]: With dead ends: 210
[2025-02-05 16:18:59,588 INFO  L226             Difference]: Without dead ends: 133
[2025-02-05 16:18:59,588 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:59,589 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:59,590 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:59,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-02-05 16:18:59,596 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-02-05 16:18:59,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions.
[2025-02-05 16:18:59,598 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37
[2025-02-05 16:18:59,598 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:59,598 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 202 transitions.
[2025-02-05 16:18:59,598 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,598 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions.
[2025-02-05 16:18:59,600 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-02-05 16:18:59,600 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:59,600 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:59,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:18:59,600 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:59,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:59,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970382673, now seen corresponding path program 1 times
[2025-02-05 16:18:59,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:59,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937005417]
[2025-02-05 16:18:59,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:59,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:59,619 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-02-05 16:18:59,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-02-05 16:18:59,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:59,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:59,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:59,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:59,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937005417]
[2025-02-05 16:18:59,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937005417] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:59,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:59,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:59,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107258963]
[2025-02-05 16:18:59,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:59,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:59,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:59,784 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:59,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:59,785 INFO  L87              Difference]: Start difference. First operand 133 states and 202 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:59,840 INFO  L93              Difference]: Finished difference Result 269 states and 432 transitions.
[2025-02-05 16:18:59,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:59,840 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-02-05 16:18:59,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:59,842 INFO  L225             Difference]: With dead ends: 269
[2025-02-05 16:18:59,843 INFO  L226             Difference]: Without dead ends: 196
[2025-02-05 16:18:59,844 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:59,844 INFO  L435           NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:59,844 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:59,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-02-05 16:18:59,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193.
[2025-02-05 16:18:59,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 193 states, 192 states have (on average 1.5625) internal successors, (300), 192 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions.
[2025-02-05 16:18:59,860 INFO  L78                 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 66
[2025-02-05 16:18:59,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:59,860 INFO  L471      AbstractCegarLoop]: Abstraction has 193 states and 300 transitions.
[2025-02-05 16:18:59,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions.
[2025-02-05 16:18:59,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-02-05 16:18:59,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:59,865 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:59,865 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:18:59,865 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:59,865 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:59,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529305302, now seen corresponding path program 1 times
[2025-02-05 16:18:59,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:59,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838567346]
[2025-02-05 16:18:59,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:59,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:59,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-02-05 16:18:59,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-02-05 16:18:59,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:59,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838567346]
[2025-02-05 16:19:00,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838567346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:00,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749529414]
[2025-02-05 16:19:00,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,008 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:00,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,008 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:00,008 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:00,009 INFO  L87              Difference]: Start difference. First operand 193 states and 300 transitions. Second operand  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:00,044 INFO  L93              Difference]: Finished difference Result 443 states and 716 transitions.
[2025-02-05 16:19:00,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:00,046 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2025-02-05 16:19:00,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,047 INFO  L225             Difference]: With dead ends: 443
[2025-02-05 16:19:00,049 INFO  L226             Difference]: Without dead ends: 310
[2025-02-05 16:19:00,049 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:00,050 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,052 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:00,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2025-02-05 16:19:00,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306.
[2025-02-05 16:19:00,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 306 states, 305 states have (on average 1.5967213114754097) internal successors, (487), 305 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 487 transitions.
[2025-02-05 16:19:00,069 INFO  L78                 Accepts]: Start accepts. Automaton has 306 states and 487 transitions. Word has length 68
[2025-02-05 16:19:00,069 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,069 INFO  L471      AbstractCegarLoop]: Abstraction has 306 states and 487 transitions.
[2025-02-05 16:19:00,069 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,069 INFO  L276                IsEmpty]: Start isEmpty. Operand 306 states and 487 transitions.
[2025-02-05 16:19:00,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:19:00,070 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,070 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,070 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:19:00,070 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 814568027, now seen corresponding path program 1 times
[2025-02-05 16:19:00,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164755079]
[2025-02-05 16:19:00,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,091 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:19:00,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:19:00,109 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164755079]
[2025-02-05 16:19:00,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164755079] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:00,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467007297]
[2025-02-05 16:19:00,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:00,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:00,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:00,203 INFO  L87              Difference]: Start difference. First operand 306 states and 487 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,238 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:00,238 INFO  L93              Difference]: Finished difference Result 766 states and 1249 transitions.
[2025-02-05 16:19:00,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:00,238 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-02-05 16:19:00,239 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,241 INFO  L225             Difference]: With dead ends: 766
[2025-02-05 16:19:00,242 INFO  L226             Difference]: Without dead ends: 520
[2025-02-05 16:19:00,243 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:00,244 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,245 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:00,246 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2025-02-05 16:19:00,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 514.
[2025-02-05 16:19:00,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 514 states, 513 states have (on average 1.612085769980507) internal successors, (827), 513 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 827 transitions.
[2025-02-05 16:19:00,294 INFO  L78                 Accepts]: Start accepts. Automaton has 514 states and 827 transitions. Word has length 70
[2025-02-05 16:19:00,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,294 INFO  L471      AbstractCegarLoop]: Abstraction has 514 states and 827 transitions.
[2025-02-05 16:19:00,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 514 states and 827 transitions.
[2025-02-05 16:19:00,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:19:00,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,295 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:19:00,295 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,295 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -842124320, now seen corresponding path program 1 times
[2025-02-05 16:19:00,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467224752]
[2025-02-05 16:19:00,296 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:19:00,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:19:00,325 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,326 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467224752]
[2025-02-05 16:19:00,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467224752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:00,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785492606]
[2025-02-05 16:19:00,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:00,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,435 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:00,435 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:00,435 INFO  L87              Difference]: Start difference. First operand 514 states and 827 transitions. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:00,601 INFO  L93              Difference]: Finished difference Result 2190 states and 3633 transitions.
[2025-02-05 16:19:00,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 16:19:00,602 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-02-05 16:19:00,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,611 INFO  L225             Difference]: With dead ends: 2190
[2025-02-05 16:19:00,611 INFO  L226             Difference]: Without dead ends: 1736
[2025-02-05 16:19:00,612 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:19:00,613 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 716 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,614 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1358 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:00,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1736 states.
[2025-02-05 16:19:00,646 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 912.
[2025-02-05 16:19:00,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 912 states, 911 states have (on average 1.628979143798024) internal successors, (1484), 911 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1484 transitions.
[2025-02-05 16:19:00,650 INFO  L78                 Accepts]: Start accepts. Automaton has 912 states and 1484 transitions. Word has length 72
[2025-02-05 16:19:00,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,650 INFO  L471      AbstractCegarLoop]: Abstraction has 912 states and 1484 transitions.
[2025-02-05 16:19:00,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 912 states and 1484 transitions.
[2025-02-05 16:19:00,651 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-02-05 16:19:00,651 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,651 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,651 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:19:00,651 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -285194949, now seen corresponding path program 1 times
[2025-02-05 16:19:00,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892017619]
[2025-02-05 16:19:00,652 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,662 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-02-05 16:19:00,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-02-05 16:19:00,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892017619]
[2025-02-05 16:19:00,762 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892017619] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,762 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,762 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:00,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773880287]
[2025-02-05 16:19:00,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,762 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:00,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,763 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:00,763 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:00,763 INFO  L87              Difference]: Start difference. First operand 912 states and 1484 transitions. Second operand  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:00,834 INFO  L93              Difference]: Finished difference Result 2654 states and 4394 transitions.
[2025-02-05 16:19:00,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:00,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2025-02-05 16:19:00,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,841 INFO  L225             Difference]: With dead ends: 2654
[2025-02-05 16:19:00,841 INFO  L226             Difference]: Without dead ends: 1802
[2025-02-05 16:19:00,842 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:00,843 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 357 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,843 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:00,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1802 states.
[2025-02-05 16:19:00,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1348.
[2025-02-05 16:19:00,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1348 states, 1347 states have (on average 1.6384558277654047) internal successors, (2207), 1347 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2207 transitions.
[2025-02-05 16:19:00,874 INFO  L78                 Accepts]: Start accepts. Automaton has 1348 states and 2207 transitions. Word has length 73
[2025-02-05 16:19:00,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,874 INFO  L471      AbstractCegarLoop]: Abstraction has 1348 states and 2207 transitions.
[2025-02-05 16:19:00,875 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 1348 states and 2207 transitions.
[2025-02-05 16:19:00,875 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:19:00,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,876 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:19:00,876 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -202100674, now seen corresponding path program 1 times
[2025-02-05 16:19:00,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257414826]
[2025-02-05 16:19:00,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:19:00,894 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:19:00,894 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,894 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257414826]
[2025-02-05 16:19:00,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257414826] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:00,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238925599]
[2025-02-05 16:19:00,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,962 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:00,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:00,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:00,962 INFO  L87              Difference]: Start difference. First operand 1348 states and 2207 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,045 INFO  L93              Difference]: Finished difference Result 3908 states and 6458 transitions.
[2025-02-05 16:19:01,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:01,045 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:19:01,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,054 INFO  L225             Difference]: With dead ends: 3908
[2025-02-05 16:19:01,054 INFO  L226             Difference]: Without dead ends: 2620
[2025-02-05 16:19:01,055 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:01,056 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,056 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2620 states.
[2025-02-05 16:19:01,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1972.
[2025-02-05 16:19:01,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1972 states, 1971 states have (on average 1.637239979705733) internal successors, (3227), 1971 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3227 transitions.
[2025-02-05 16:19:01,123 INFO  L78                 Accepts]: Start accepts. Automaton has 1972 states and 3227 transitions. Word has length 74
[2025-02-05 16:19:01,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,124 INFO  L471      AbstractCegarLoop]: Abstraction has 1972 states and 3227 transitions.
[2025-02-05 16:19:01,124 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 1972 states and 3227 transitions.
[2025-02-05 16:19:01,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-02-05 16:19:01,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,129 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:19:01,129 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,129 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922992487, now seen corresponding path program 1 times
[2025-02-05 16:19:01,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544567028]
[2025-02-05 16:19:01,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-02-05 16:19:01,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-02-05 16:19:01,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544567028]
[2025-02-05 16:19:01,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544567028] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:01,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734289400]
[2025-02-05 16:19:01,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:01,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:01,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:01,226 INFO  L87              Difference]: Start difference. First operand 1972 states and 3227 transitions. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,310 INFO  L93              Difference]: Finished difference Result 5692 states and 9382 transitions.
[2025-02-05 16:19:01,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:01,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2025-02-05 16:19:01,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,321 INFO  L225             Difference]: With dead ends: 5692
[2025-02-05 16:19:01,321 INFO  L226             Difference]: Without dead ends: 3780
[2025-02-05 16:19:01,324 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:01,324 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,325 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3780 states.
[2025-02-05 16:19:01,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2860.
[2025-02-05 16:19:01,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2860 states, 2859 states have (on average 1.634487583071004) internal successors, (4673), 2859 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4673 transitions.
[2025-02-05 16:19:01,396 INFO  L78                 Accepts]: Start accepts. Automaton has 2860 states and 4673 transitions. Word has length 75
[2025-02-05 16:19:01,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,397 INFO  L471      AbstractCegarLoop]: Abstraction has 2860 states and 4673 transitions.
[2025-02-05 16:19:01,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 2860 states and 4673 transitions.
[2025-02-05 16:19:01,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:19:01,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,398 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,398 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:19:01,399 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,399 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 40102235, now seen corresponding path program 1 times
[2025-02-05 16:19:01,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530935525]
[2025-02-05 16:19:01,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,421 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:19:01,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:19:01,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530935525]
[2025-02-05 16:19:01,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530935525] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:01,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849862216]
[2025-02-05 16:19:01,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,460 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:01,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,461 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:01,461 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,461 INFO  L87              Difference]: Start difference. First operand 2860 states and 4673 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,515 INFO  L93              Difference]: Finished difference Result 6485 states and 10687 transitions.
[2025-02-05 16:19:01,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:01,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:19:01,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,527 INFO  L225             Difference]: With dead ends: 6485
[2025-02-05 16:19:01,528 INFO  L226             Difference]: Without dead ends: 4424
[2025-02-05 16:19:01,530 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,531 INFO  L435           NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,531 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4424 states.
[2025-02-05 16:19:01,589 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4422.
[2025-02-05 16:19:01,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4422 states, 4421 states have (on average 1.6315313277539019) internal successors, (7213), 4421 states have internal predecessors, (7213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 7213 transitions.
[2025-02-05 16:19:01,607 INFO  L78                 Accepts]: Start accepts. Automaton has 4422 states and 7213 transitions. Word has length 76
[2025-02-05 16:19:01,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,608 INFO  L471      AbstractCegarLoop]: Abstraction has 4422 states and 7213 transitions.
[2025-02-05 16:19:01,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 4422 states and 7213 transitions.
[2025-02-05 16:19:01,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:19:01,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,608 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:19:01,609 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065286811, now seen corresponding path program 1 times
[2025-02-05 16:19:01,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589720208]
[2025-02-05 16:19:01,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:19:01,625 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:19:01,626 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,626 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589720208]
[2025-02-05 16:19:01,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589720208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:01,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158398322]
[2025-02-05 16:19:01,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:01,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:01,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,659 INFO  L87              Difference]: Start difference. First operand 4422 states and 7213 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,752 INFO  L93              Difference]: Finished difference Result 9899 states and 16167 transitions.
[2025-02-05 16:19:01,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:01,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:19:01,753 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,772 INFO  L225             Difference]: With dead ends: 9899
[2025-02-05 16:19:01,772 INFO  L226             Difference]: Without dead ends: 6744
[2025-02-05 16:19:01,777 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,778 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6744 states.
[2025-02-05 16:19:01,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6744 to 6742.
[2025-02-05 16:19:01,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6742 states, 6741 states have (on average 1.6181575433911883) internal successors, (10908), 6741 states have internal predecessors, (10908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6742 states to 6742 states and 10908 transitions.
[2025-02-05 16:19:01,922 INFO  L78                 Accepts]: Start accepts. Automaton has 6742 states and 10908 transitions. Word has length 76
[2025-02-05 16:19:01,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,922 INFO  L471      AbstractCegarLoop]: Abstraction has 6742 states and 10908 transitions.
[2025-02-05 16:19:01,922 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,922 INFO  L276                IsEmpty]: Start isEmpty. Operand 6742 states and 10908 transitions.
[2025-02-05 16:19:01,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:19:01,923 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,923 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,923 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:19:01,923 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -432439333, now seen corresponding path program 1 times
[2025-02-05 16:19:01,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751418244]
[2025-02-05 16:19:01,925 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,959 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:19:01,968 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:19:01,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751418244]
[2025-02-05 16:19:02,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751418244] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:02,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203562935]
[2025-02-05 16:19:02,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,002 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:02,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,002 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:02,002 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,002 INFO  L87              Difference]: Start difference. First operand 6742 states and 10908 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,119 INFO  L93              Difference]: Finished difference Result 15008 states and 24288 transitions.
[2025-02-05 16:19:02,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:02,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:19:02,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,150 INFO  L225             Difference]: With dead ends: 15008
[2025-02-05 16:19:02,150 INFO  L226             Difference]: Without dead ends: 10171
[2025-02-05 16:19:02,157 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,158 INFO  L435           NwaCegarLoop]: 269 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:02,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10171 states.
[2025-02-05 16:19:02,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169.
[2025-02-05 16:19:02,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10169 states, 10168 states have (on average 1.6009047993705743) internal successors, (16278), 10168 states have internal predecessors, (16278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16278 transitions.
[2025-02-05 16:19:02,467 INFO  L78                 Accepts]: Start accepts. Automaton has 10169 states and 16278 transitions. Word has length 76
[2025-02-05 16:19:02,467 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,467 INFO  L471      AbstractCegarLoop]: Abstraction has 10169 states and 16278 transitions.
[2025-02-05 16:19:02,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,468 INFO  L276                IsEmpty]: Start isEmpty. Operand 10169 states and 16278 transitions.
[2025-02-05 16:19:02,468 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 16:19:02,468 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,469 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:02,469 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:19:02,469 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 288360439, now seen corresponding path program 1 times
[2025-02-05 16:19:02,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472825696]
[2025-02-05 16:19:02,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 16:19:02,491 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 16:19:02,492 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,492 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472825696]
[2025-02-05 16:19:02,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472825696] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:02,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482250693]
[2025-02-05 16:19:02,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,670 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:02,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:02,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:02,671 INFO  L87              Difference]: Start difference. First operand 10169 states and 16278 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,900 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,900 INFO  L93              Difference]: Finished difference Result 20262 states and 32453 transitions.
[2025-02-05 16:19:02,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:02,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-02-05 16:19:02,903 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,921 INFO  L225             Difference]: With dead ends: 20262
[2025-02-05 16:19:02,922 INFO  L226             Difference]: Without dead ends: 10171
[2025-02-05 16:19:02,932 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-05 16:19:02,933 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 189 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,933 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 538 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:02,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10171 states.
[2025-02-05 16:19:03,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169.
[2025-02-05 16:19:03,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10169 states, 10168 states have (on average 1.5886113296616837) internal successors, (16153), 10168 states have internal predecessors, (16153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16153 transitions.
[2025-02-05 16:19:03,139 INFO  L78                 Accepts]: Start accepts. Automaton has 10169 states and 16153 transitions. Word has length 77
[2025-02-05 16:19:03,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:03,139 INFO  L471      AbstractCegarLoop]: Abstraction has 10169 states and 16153 transitions.
[2025-02-05 16:19:03,139 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,139 INFO  L276                IsEmpty]: Start isEmpty. Operand 10169 states and 16153 transitions.
[2025-02-05 16:19:03,140 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-02-05 16:19:03,140 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:03,140 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:03,140 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:19:03,140 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:03,141 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:03,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -2017343017, now seen corresponding path program 1 times
[2025-02-05 16:19:03,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:03,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803919168]
[2025-02-05 16:19:03,141 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:03,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:03,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-02-05 16:19:03,201 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-02-05 16:19:03,201 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:03,201 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:03,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:03,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:03,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803919168]
[2025-02-05 16:19:03,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803919168] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:03,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:03,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:03,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628101426]
[2025-02-05 16:19:03,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:03,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:03,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:03,351 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:03,351 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:03,351 INFO  L87              Difference]: Start difference. First operand 10169 states and 16153 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:03,599 INFO  L93              Difference]: Finished difference Result 29138 states and 46435 transitions.
[2025-02-05 16:19:03,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:03,600 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-02-05 16:19:03,600 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:03,699 INFO  L225             Difference]: With dead ends: 29138
[2025-02-05 16:19:03,699 INFO  L226             Difference]: Without dead ends: 19047
[2025-02-05 16:19:03,707 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-05 16:19:03,708 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 93 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:03,708 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 714 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:03,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19047 states.
[2025-02-05 16:19:04,043 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 19045.
[2025-02-05 16:19:04,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19045 states, 19044 states have (on average 1.5750892669607226) internal successors, (29996), 19044 states have internal predecessors, (29996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 29996 transitions.
[2025-02-05 16:19:04,111 INFO  L78                 Accepts]: Start accepts. Automaton has 19045 states and 29996 transitions. Word has length 80
[2025-02-05 16:19:04,111 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:04,112 INFO  L471      AbstractCegarLoop]: Abstraction has 19045 states and 29996 transitions.
[2025-02-05 16:19:04,112 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 19045 states and 29996 transitions.
[2025-02-05 16:19:04,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-02-05 16:19:04,112 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:04,113 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:04,113 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:19:04,113 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:04,113 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:04,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919260688, now seen corresponding path program 1 times
[2025-02-05 16:19:04,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:04,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240118387]
[2025-02-05 16:19:04,114 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:04,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:04,125 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-02-05 16:19:04,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-02-05 16:19:04,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:04,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:04,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:04,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:04,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240118387]
[2025-02-05 16:19:04,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240118387] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:04,348 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:04,348 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:04,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596401294]
[2025-02-05 16:19:04,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:04,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:04,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:04,349 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:04,349 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:04,349 INFO  L87              Difference]: Start difference. First operand 19045 states and 29996 transitions. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:04,558 INFO  L93              Difference]: Finished difference Result 20133 states and 31445 transitions.
[2025-02-05 16:19:04,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:04,558 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-02-05 16:19:04,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:04,597 INFO  L225             Difference]: With dead ends: 20133
[2025-02-05 16:19:04,597 INFO  L226             Difference]: Without dead ends: 20131
[2025-02-05 16:19:04,606 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:04,607 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:04,607 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:04,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20131 states.
[2025-02-05 16:19:05,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131.
[2025-02-05 16:19:05,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20131 states, 20130 states have (on average 1.5436164927968206) internal successors, (31073), 20130 states have internal predecessors, (31073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 31073 transitions.
[2025-02-05 16:19:05,160 INFO  L78                 Accepts]: Start accepts. Automaton has 20131 states and 31073 transitions. Word has length 81
[2025-02-05 16:19:05,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:05,160 INFO  L471      AbstractCegarLoop]: Abstraction has 20131 states and 31073 transitions.
[2025-02-05 16:19:05,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 20131 states and 31073 transitions.
[2025-02-05 16:19:05,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:05,162 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:05,162 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:05,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:19:05,162 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:05,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:05,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -460291343, now seen corresponding path program 1 times
[2025-02-05 16:19:05,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:05,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838987492]
[2025-02-05 16:19:05,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:05,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:05,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:05,185 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:05,185 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:05,185 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:05,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:05,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:05,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838987492]
[2025-02-05 16:19:05,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838987492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:05,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:05,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:05,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516405704]
[2025-02-05 16:19:05,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:05,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:05,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:05,291 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:05,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:05,291 INFO  L87              Difference]: Start difference. First operand 20131 states and 31073 transitions. Second operand  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,731 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:05,732 INFO  L93              Difference]: Finished difference Result 49659 states and 76963 transitions.
[2025-02-05 16:19:05,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:05,732 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:05,733 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:05,811 INFO  L225             Difference]: With dead ends: 49659
[2025-02-05 16:19:05,811 INFO  L226             Difference]: Without dead ends: 39817
[2025-02-05 16:19:05,832 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:05,833 INFO  L435           NwaCegarLoop]: 310 mSDtfsCounter, 450 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:05,833 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 876 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:05,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39817 states.
[2025-02-05 16:19:06,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39817 to 31027.
[2025-02-05 16:19:06,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31027 states, 31026 states have (on average 1.5411912589441115) internal successors, (47817), 31026 states have internal predecessors, (47817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31027 states to 31027 states and 47817 transitions.
[2025-02-05 16:19:06,501 INFO  L78                 Accepts]: Start accepts. Automaton has 31027 states and 47817 transitions. Word has length 109
[2025-02-05 16:19:06,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:06,502 INFO  L471      AbstractCegarLoop]: Abstraction has 31027 states and 47817 transitions.
[2025-02-05 16:19:06,502 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 31027 states and 47817 transitions.
[2025-02-05 16:19:06,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:06,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:06,504 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:06,504 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:19:06,504 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:06,505 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:06,505 INFO  L85        PathProgramCache]: Analyzing trace with hash 564893233, now seen corresponding path program 1 times
[2025-02-05 16:19:06,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:06,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971199617]
[2025-02-05 16:19:06,505 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:06,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:06,515 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:06,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:06,525 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:06,525 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:06,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-05 16:19:06,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:06,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971199617]
[2025-02-05 16:19:06,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971199617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:06,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:06,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:06,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029165067]
[2025-02-05 16:19:06,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:06,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:06,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:06,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:06,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:06,614 INFO  L87              Difference]: Start difference. First operand 31027 states and 47817 transitions. Second operand  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:07,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:07,126 INFO  L93              Difference]: Finished difference Result 55735 states and 86393 transitions.
[2025-02-05 16:19:07,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:07,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:07,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:07,220 INFO  L225             Difference]: With dead ends: 55735
[2025-02-05 16:19:07,220 INFO  L226             Difference]: Without dead ends: 46153
[2025-02-05 16:19:07,242 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:07,242 INFO  L435           NwaCegarLoop]: 316 mSDtfsCounter, 443 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:07,243 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 931 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:07,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46153 states.
[2025-02-05 16:19:07,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46153 to 42179.
[2025-02-05 16:19:08,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42179 states, 42178 states have (on average 1.542960785243492) internal successors, (65079), 42178 states have internal predecessors, (65079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42179 states to 42179 states and 65079 transitions.
[2025-02-05 16:19:08,116 INFO  L78                 Accepts]: Start accepts. Automaton has 42179 states and 65079 transitions. Word has length 109
[2025-02-05 16:19:08,116 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:08,117 INFO  L471      AbstractCegarLoop]: Abstraction has 42179 states and 65079 transitions.
[2025-02-05 16:19:08,117 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,117 INFO  L276                IsEmpty]: Start isEmpty. Operand 42179 states and 65079 transitions.
[2025-02-05 16:19:08,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:08,119 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:08,119 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:08,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:19:08,119 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:08,120 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:08,120 INFO  L85        PathProgramCache]: Analyzing trace with hash -932832911, now seen corresponding path program 1 times
[2025-02-05 16:19:08,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:08,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538373146]
[2025-02-05 16:19:08,120 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:08,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:08,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:08,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:08,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:08,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:08,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-02-05 16:19:08,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:08,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538373146]
[2025-02-05 16:19:08,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538373146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:08,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:08,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:08,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867626117]
[2025-02-05 16:19:08,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:08,298 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:08,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:08,299 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:08,299 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:08,299 INFO  L87              Difference]: Start difference. First operand 42179 states and 65079 transitions. Second operand  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:08,868 INFO  L93              Difference]: Finished difference Result 59599 states and 92385 transitions.
[2025-02-05 16:19:08,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:08,869 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:08,871 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:08,968 INFO  L225             Difference]: With dead ends: 59599
[2025-02-05 16:19:08,968 INFO  L226             Difference]: Without dead ends: 50017
[2025-02-05 16:19:08,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:08,993 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:08,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 882 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:09,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50017 states.
[2025-02-05 16:19:09,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50017 to 48411.
[2025-02-05 16:19:09,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48411 states, 48410 states have (on average 1.5449493906217724) internal successors, (74791), 48410 states have internal predecessors, (74791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:09,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48411 states to 48411 states and 74791 transitions.
[2025-02-05 16:19:09,975 INFO  L78                 Accepts]: Start accepts. Automaton has 48411 states and 74791 transitions. Word has length 109
[2025-02-05 16:19:09,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:09,975 INFO  L471      AbstractCegarLoop]: Abstraction has 48411 states and 74791 transitions.
[2025-02-05 16:19:09,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:09,976 INFO  L276                IsEmpty]: Start isEmpty. Operand 48411 states and 74791 transitions.
[2025-02-05 16:19:09,977 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-02-05 16:19:09,977 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:09,977 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:09,977 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:19:09,977 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:09,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:09,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -1333274550, now seen corresponding path program 1 times
[2025-02-05 16:19:09,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:09,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866623208]
[2025-02-05 16:19:09,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:09,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:09,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-02-05 16:19:09,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-02-05 16:19:09,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:09,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:10,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:10,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:10,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866623208]
[2025-02-05 16:19:10,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866623208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:10,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:10,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:10,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316678367]
[2025-02-05 16:19:10,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:10,077 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:10,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:10,077 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:10,077 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:10,078 INFO  L87              Difference]: Start difference. First operand 48411 states and 74791 transitions. Second operand  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:10,914 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:10,915 INFO  L93              Difference]: Finished difference Result 79154 states and 122950 transitions.
[2025-02-05 16:19:10,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:10,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-02-05 16:19:10,916 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:11,018 INFO  L225             Difference]: With dead ends: 79154
[2025-02-05 16:19:11,019 INFO  L226             Difference]: Without dead ends: 62976
[2025-02-05 16:19:11,043 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:11,044 INFO  L435           NwaCegarLoop]: 305 mSDtfsCounter, 196 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:11,044 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 607 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:11,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62976 states.
[2025-02-05 16:19:12,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62976 to 61372.
[2025-02-05 16:19:12,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61372 states, 61371 states have (on average 1.5451434716722883) internal successors, (94827), 61371 states have internal predecessors, (94827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:12,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61372 states to 61372 states and 94827 transitions.
[2025-02-05 16:19:12,385 INFO  L78                 Accepts]: Start accepts. Automaton has 61372 states and 94827 transitions. Word has length 110
[2025-02-05 16:19:12,385 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:12,385 INFO  L471      AbstractCegarLoop]: Abstraction has 61372 states and 94827 transitions.
[2025-02-05 16:19:12,385 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:12,385 INFO  L276                IsEmpty]: Start isEmpty. Operand 61372 states and 94827 transitions.
[2025-02-05 16:19:12,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-02-05 16:19:12,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:12,388 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:12,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:19:12,388 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:12,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:12,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121923637, now seen corresponding path program 1 times
[2025-02-05 16:19:12,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:12,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106177487]
[2025-02-05 16:19:12,389 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:12,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:12,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-02-05 16:19:12,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-02-05 16:19:12,407 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:12,407 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:12,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:12,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:12,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106177487]
[2025-02-05 16:19:12,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106177487] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:12,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:12,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:12,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164836664]
[2025-02-05 16:19:12,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:12,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:12,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:12,444 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:12,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:12,445 INFO  L87              Difference]: Start difference. First operand 61372 states and 94827 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:13,470 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:13,471 INFO  L93              Difference]: Finished difference Result 132988 states and 206196 transitions.
[2025-02-05 16:19:13,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:13,471 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-02-05 16:19:13,472 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:13,634 INFO  L225             Difference]: With dead ends: 132988
[2025-02-05 16:19:13,635 INFO  L226             Difference]: Without dead ends: 103954
[2025-02-05 16:19:13,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:13,670 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:13,670 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 371 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:13,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103954 states.
[2025-02-05 16:19:15,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103954 to 103676.
[2025-02-05 16:19:15,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103676 states, 103675 states have (on average 1.5447986496262358) internal successors, (160157), 103675 states have internal predecessors, (160157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:15,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103676 states to 103676 states and 160157 transitions.
[2025-02-05 16:19:15,599 INFO  L78                 Accepts]: Start accepts. Automaton has 103676 states and 160157 transitions. Word has length 110
[2025-02-05 16:19:15,600 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:15,600 INFO  L471      AbstractCegarLoop]: Abstraction has 103676 states and 160157 transitions.
[2025-02-05 16:19:15,600 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:15,600 INFO  L276                IsEmpty]: Start isEmpty. Operand 103676 states and 160157 transitions.
[2025-02-05 16:19:15,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 16:19:15,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:15,607 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:15,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:19:15,607 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:15,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:15,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 665586502, now seen corresponding path program 1 times
[2025-02-05 16:19:15,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:15,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162452939]
[2025-02-05 16:19:15,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:15,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:15,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 16:19:15,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 16:19:15,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:15,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:15,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:15,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:15,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162452939]
[2025-02-05 16:19:15,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162452939] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:15,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:15,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:15,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727449157]
[2025-02-05 16:19:15,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:15,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:15,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:15,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:15,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:15,673 INFO  L87              Difference]: Start difference. First operand 103676 states and 160157 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:17,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:17,437 INFO  L93              Difference]: Finished difference Result 308726 states and 475922 transitions.
[2025-02-05 16:19:17,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:17,437 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-02-05 16:19:17,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:17,841 INFO  L225             Difference]: With dead ends: 308726
[2025-02-05 16:19:17,842 INFO  L226             Difference]: Without dead ends: 205122
[2025-02-05 16:19:17,938 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:17,939 INFO  L435           NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:17,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:18,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205122 states.
[2025-02-05 16:19:21,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205122 to 205120.
[2025-02-05 16:19:21,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 205120 states, 205119 states have (on average 1.5291123689175552) internal successors, (313650), 205119 states have internal predecessors, (313650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:21,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 205120 states to 205120 states and 313650 transitions.
[2025-02-05 16:19:21,608 INFO  L78                 Accepts]: Start accepts. Automaton has 205120 states and 313650 transitions. Word has length 111
[2025-02-05 16:19:21,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:21,608 INFO  L471      AbstractCegarLoop]: Abstraction has 205120 states and 313650 transitions.
[2025-02-05 16:19:21,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:21,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 205120 states and 313650 transitions.
[2025-02-05 16:19:21,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 16:19:21,616 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:21,620 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:21,621 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 16:19:21,621 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:21,621 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:21,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 757077958, now seen corresponding path program 1 times
[2025-02-05 16:19:21,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:21,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774456989]
[2025-02-05 16:19:21,621 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:21,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:21,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 16:19:21,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 16:19:21,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:21,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:21,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:21,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:21,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774456989]
[2025-02-05 16:19:21,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774456989] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:21,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:21,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:21,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091032805]
[2025-02-05 16:19:21,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:21,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:21,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:21,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:21,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:21,694 INFO  L87              Difference]: Start difference. First operand 205120 states and 313650 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:26,146 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:26,146 INFO  L93              Difference]: Finished difference Result 610797 states and 931927 transitions.
[2025-02-05 16:19:26,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:26,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-02-05 16:19:26,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:27,018 INFO  L225             Difference]: With dead ends: 610797
[2025-02-05 16:19:27,019 INFO  L226             Difference]: Without dead ends: 405811
[2025-02-05 16:19:27,183 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:27,185 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:27,185 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:27,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 405811 states.
[2025-02-05 16:19:33,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 405811 to 405809.
[2025-02-05 16:19:33,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 405809 states, 405808 states have (on average 1.513102255253716) internal successors, (614029), 405808 states have internal predecessors, (614029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:35,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 405809 states to 405809 states and 614029 transitions.
[2025-02-05 16:19:35,407 INFO  L78                 Accepts]: Start accepts. Automaton has 405809 states and 614029 transitions. Word has length 111
[2025-02-05 16:19:35,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:35,407 INFO  L471      AbstractCegarLoop]: Abstraction has 405809 states and 614029 transitions.
[2025-02-05 16:19:35,407 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:35,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 405809 states and 614029 transitions.
[2025-02-05 16:19:35,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 16:19:35,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:35,412 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:35,413 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 16:19:35,413 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:35,414 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:35,414 INFO  L85        PathProgramCache]: Analyzing trace with hash -972930481, now seen corresponding path program 1 times
[2025-02-05 16:19:35,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:35,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850402200]
[2025-02-05 16:19:35,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:35,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:35,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 16:19:35,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 16:19:35,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:35,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:35,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-05 16:19:35,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:35,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850402200]
[2025-02-05 16:19:35,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850402200] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:35,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:35,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:35,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462686045]
[2025-02-05 16:19:35,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:35,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:35,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:35,538 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:35,538 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:35,538 INFO  L87              Difference]: Start difference. First operand 405809 states and 614029 transitions. Second operand  has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)