./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c --full-output --architecture 64bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547
[2025-03-03 17:01:30,469 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 17:01:30,474 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 17:01:30,478 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 17:01:30,478 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 17:01:30,479 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 17:01:30,480 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c
[2025-03-03 17:01:31,608 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f18cfb366/eaa26dc28e474e8b885cf1163e7b6340/FLAGb6a8163c3
[2025-03-03 17:01:31,899 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 17:01:31,900 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c
[2025-03-03 17:01:31,919 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f18cfb366/eaa26dc28e474e8b885cf1163e7b6340/FLAGb6a8163c3
[2025-03-03 17:01:31,935 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f18cfb366/eaa26dc28e474e8b885cf1163e7b6340
[2025-03-03 17:01:31,937 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 17:01:31,938 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 17:01:31,939 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 17:01:31,939 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 17:01:31,942 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 17:01:31,942 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:01:31" (1/1) ...
[2025-03-03 17:01:31,944 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42940b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:31, skipping insertion in model container
[2025-03-03 17:01:31,944 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:01:31" (1/1) ...
[2025-03-03 17:01:31,988 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 17:01:32,124 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258]
[2025-03-03 17:01:32,346 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 17:01:32,353 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 17:01:32,361 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258]
[2025-03-03 17:01:32,481 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 17:01:32,491 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 17:01:32,492 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32 WrapperNode
[2025-03-03 17:01:32,492 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 17:01:32,493 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 17:01:32,493 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 17:01:32,493 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 17:01:32,497 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:32,541 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:32,820 INFO  L138                Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3556
[2025-03-03 17:01:32,821 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 17:01:32,821 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 17:01:32,822 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 17:01:32,822 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 17:01:32,828 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:32,828 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:32,882 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,005 INFO  L175           MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0].
[2025-03-03 17:01:33,006 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,006 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,124 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,160 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,191 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,211 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,252 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 17:01:33,254 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 17:01:33,255 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 17:01:33,255 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 17:01:33,256 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (1/1) ...
[2025-03-03 17:01:33,267 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 17:01:33,280 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 17:01:33,309 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 17:01:33,311 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 17:01:33,328 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 17:01:33,329 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 17:01:33,329 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-03 17:01:33,329 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 17:01:33,329 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 17:01:33,572 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 17:01:33,574 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 17:01:36,484 INFO  L?                        ?]: Removed 1995 outVars from TransFormulas that were not future-live.
[2025-03-03 17:01:36,485 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 17:01:36,579 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 17:01:36,579 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 17:01:36,579 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:01:36 BoogieIcfgContainer
[2025-03-03 17:01:36,580 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 17:01:36,581 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 17:01:36,581 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 17:01:36,585 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 17:01:36,585 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:01:31" (1/3) ...
[2025-03-03 17:01:36,585 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f853f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:01:36, skipping insertion in model container
[2025-03-03 17:01:36,585 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:01:32" (2/3) ...
[2025-03-03 17:01:36,585 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f853f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:01:36, skipping insertion in model container
[2025-03-03 17:01:36,585 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:01:36" (3/3) ...
[2025-03-03 17:01:36,586 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal20.c
[2025-03-03 17:01:36,601 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 17:01:36,602 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal20.c that has 1 procedures, 1061 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 17:01:36,695 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 17:01:36,716 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;@3383a943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 17:01:36,716 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 17:01:36,722 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:36,752 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 334
[2025-03-03 17:01:36,753 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:36,753 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:36,754 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:36,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:36,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -1541320656, now seen corresponding path program 1 times
[2025-03-03 17:01:36,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:36,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127749677]
[2025-03-03 17:01:36,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:36,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:36,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes.
[2025-03-03 17:01:37,348 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements.
[2025-03-03 17:01:37,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:37,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:38,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:38,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:38,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127749677]
[2025-03-03 17:01:38,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127749677] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:38,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:38,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:01:38,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010295163]
[2025-03-03 17:01:38,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:38,832 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:01:38,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:38,891 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:01:38,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:01:38,902 INFO  L87              Difference]: Start difference. First operand  has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 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 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:39,431 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:39,432 INFO  L93              Difference]: Finished difference Result 2091 states and 3135 transitions.
[2025-03-03 17:01:39,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:01:39,437 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 333
[2025-03-03 17:01:39,438 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:39,455 INFO  L225             Difference]: With dead ends: 2091
[2025-03-03 17:01:39,456 INFO  L226             Difference]: Without dead ends: 1060
[2025-03-03 17:01:39,461 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:01:39,463 INFO  L435           NwaCegarLoop]: 1321 mSDtfsCounter, 0 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:39,463 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3958 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 17:01:39,476 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1060 states.
[2025-03-03 17:01:39,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060.
[2025-03-03 17:01:39,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1060 states, 1059 states have (on average 1.498583569405099) internal successors, (1587), 1059 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:39,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1587 transitions.
[2025-03-03 17:01:39,526 INFO  L78                 Accepts]: Start accepts. Automaton has 1060 states and 1587 transitions. Word has length 333
[2025-03-03 17:01:39,527 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:39,527 INFO  L471      AbstractCegarLoop]: Abstraction has 1060 states and 1587 transitions.
[2025-03-03 17:01:39,527 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:39,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 1060 states and 1587 transitions.
[2025-03-03 17:01:39,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-03 17:01:39,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:39,530 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:39,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 17:01:39,531 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:39,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:39,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -531620249, now seen corresponding path program 1 times
[2025-03-03 17:01:39,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:39,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461621472]
[2025-03-03 17:01:39,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:39,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:39,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-03 17:01:39,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-03 17:01:39,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:39,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:40,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:40,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:40,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461621472]
[2025-03-03 17:01:40,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461621472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:40,315 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:40,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:01:40,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139237682]
[2025-03-03 17:01:40,315 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:40,316 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:01:40,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:40,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:01:40,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:01:40,319 INFO  L87              Difference]: Start difference. First operand 1060 states and 1587 transitions. Second operand  has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:40,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:40,737 INFO  L93              Difference]: Finished difference Result 2092 states and 3133 transitions.
[2025-03-03 17:01:40,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:01:40,738 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 334
[2025-03-03 17:01:40,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:40,742 INFO  L225             Difference]: With dead ends: 2092
[2025-03-03 17:01:40,742 INFO  L226             Difference]: Without dead ends: 1062
[2025-03-03 17:01:40,743 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:01:40,744 INFO  L435           NwaCegarLoop]: 1321 mSDtfsCounter, 0 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:40,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3955 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:01:40,745 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1062 states.
[2025-03-03 17:01:40,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062.
[2025-03-03 17:01:40,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1062 states, 1061 states have (on average 1.4976437323279925) internal successors, (1589), 1061 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:40,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1589 transitions.
[2025-03-03 17:01:40,761 INFO  L78                 Accepts]: Start accepts. Automaton has 1062 states and 1589 transitions. Word has length 334
[2025-03-03 17:01:40,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:40,762 INFO  L471      AbstractCegarLoop]: Abstraction has 1062 states and 1589 transitions.
[2025-03-03 17:01:40,762 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:40,762 INFO  L276                IsEmpty]: Start isEmpty. Operand 1062 states and 1589 transitions.
[2025-03-03 17:01:40,764 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-03-03 17:01:40,765 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:40,765 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:40,765 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 17:01:40,765 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:40,768 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:40,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -1663815925, now seen corresponding path program 1 times
[2025-03-03 17:01:40,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:40,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065838346]
[2025-03-03 17:01:40,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:40,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:40,840 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-03-03 17:01:42,375 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-03-03 17:01:42,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:42,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:43,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:43,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:43,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065838346]
[2025-03-03 17:01:43,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065838346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:43,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:43,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 17:01:43,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704116485]
[2025-03-03 17:01:43,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:43,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 17:01:43,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:43,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 17:01:43,701 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:01:43,701 INFO  L87              Difference]: Start difference. First operand 1062 states and 1589 transitions. Second operand  has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:44,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:44,496 INFO  L93              Difference]: Finished difference Result 2734 states and 4091 transitions.
[2025-03-03 17:01:44,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 17:01:44,497 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335
[2025-03-03 17:01:44,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:44,502 INFO  L225             Difference]: With dead ends: 2734
[2025-03-03 17:01:44,503 INFO  L226             Difference]: Without dead ends: 1702
[2025-03-03 17:01:44,504 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-03 17:01:44,505 INFO  L435           NwaCegarLoop]: 1302 mSDtfsCounter, 4049 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 5209 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:44,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 5209 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:01:44,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1702 states.
[2025-03-03 17:01:44,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1683.
[2025-03-03 17:01:44,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1683 states, 1682 states have (on average 1.4988109393579072) internal successors, (2521), 1682 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:44,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2521 transitions.
[2025-03-03 17:01:44,561 INFO  L78                 Accepts]: Start accepts. Automaton has 1683 states and 2521 transitions. Word has length 335
[2025-03-03 17:01:44,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:44,561 INFO  L471      AbstractCegarLoop]: Abstraction has 1683 states and 2521 transitions.
[2025-03-03 17:01:44,562 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:44,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 1683 states and 2521 transitions.
[2025-03-03 17:01:44,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 337
[2025-03-03 17:01:44,567 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:44,567 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:44,568 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 17:01:44,568 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:44,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:44,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 1849677068, now seen corresponding path program 1 times
[2025-03-03 17:01:44,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:44,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166718016]
[2025-03-03 17:01:44,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:44,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:44,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes.
[2025-03-03 17:01:45,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements.
[2025-03-03 17:01:45,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:45,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:46,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:46,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:46,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166718016]
[2025-03-03 17:01:46,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166718016] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:46,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:46,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:01:46,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259718194]
[2025-03-03 17:01:46,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:46,601 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:01:46,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:46,601 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:01:46,601 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:01:46,601 INFO  L87              Difference]: Start difference. First operand 1683 states and 2521 transitions. Second operand  has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:47,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:47,634 INFO  L93              Difference]: Finished difference Result 2736 states and 4093 transitions.
[2025-03-03 17:01:47,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:01:47,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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 336
[2025-03-03 17:01:47,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:47,639 INFO  L225             Difference]: With dead ends: 2736
[2025-03-03 17:01:47,639 INFO  L226             Difference]: Without dead ends: 1704
[2025-03-03 17:01:47,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2025-03-03 17:01:47,641 INFO  L435           NwaCegarLoop]: 1301 mSDtfsCounter, 4052 mSDsluCounter, 6501 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 7802 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:47,641 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 7802 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 17:01:47,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1704 states.
[2025-03-03 17:01:47,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1686.
[2025-03-03 17:01:47,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1686 states, 1685 states have (on average 1.4985163204747773) internal successors, (2525), 1685 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:47,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2525 transitions.
[2025-03-03 17:01:47,667 INFO  L78                 Accepts]: Start accepts. Automaton has 1686 states and 2525 transitions. Word has length 336
[2025-03-03 17:01:47,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:47,668 INFO  L471      AbstractCegarLoop]: Abstraction has 1686 states and 2525 transitions.
[2025-03-03 17:01:47,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:47,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 1686 states and 2525 transitions.
[2025-03-03 17:01:47,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 338
[2025-03-03 17:01:47,670 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:47,671 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:47,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 17:01:47,671 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:47,671 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:47,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -1168724522, now seen corresponding path program 1 times
[2025-03-03 17:01:47,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:47,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796815670]
[2025-03-03 17:01:47,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:47,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:47,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes.
[2025-03-03 17:01:48,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements.
[2025-03-03 17:01:48,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:48,770 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:50,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:50,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:50,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796815670]
[2025-03-03 17:01:50,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796815670] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:50,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:50,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 17:01:50,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903664662]
[2025-03-03 17:01:50,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:50,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 17:01:50,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:50,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 17:01:50,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-03 17:01:50,255 INFO  L87              Difference]: Start difference. First operand 1686 states and 2525 transitions. Second operand  has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:51,413 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:51,413 INFO  L93              Difference]: Finished difference Result 2736 states and 4092 transitions.
[2025-03-03 17:01:51,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 17:01:51,414 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 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 337
[2025-03-03 17:01:51,414 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:51,419 INFO  L225             Difference]: With dead ends: 2736
[2025-03-03 17:01:51,419 INFO  L226             Difference]: Without dead ends: 1704
[2025-03-03 17:01:51,420 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2025-03-03 17:01:51,423 INFO  L435           NwaCegarLoop]: 1296 mSDtfsCounter, 4046 mSDsluCounter, 7774 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 9070 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:51,423 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 9070 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 17:01:51,425 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1704 states.
[2025-03-03 17:01:51,446 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1690.
[2025-03-03 17:01:51,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1690 states, 1689 states have (on average 1.4979277679100058) internal successors, (2530), 1689 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:51,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2530 transitions.
[2025-03-03 17:01:51,452 INFO  L78                 Accepts]: Start accepts. Automaton has 1690 states and 2530 transitions. Word has length 337
[2025-03-03 17:01:51,453 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:51,453 INFO  L471      AbstractCegarLoop]: Abstraction has 1690 states and 2530 transitions.
[2025-03-03 17:01:51,454 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:51,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 1690 states and 2530 transitions.
[2025-03-03 17:01:51,456 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-03 17:01:51,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:51,456 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:51,456 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 17:01:51,456 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:51,457 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:51,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -928227769, now seen corresponding path program 1 times
[2025-03-03 17:01:51,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:51,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354158561]
[2025-03-03 17:01:51,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:51,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:51,536 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-03 17:01:52,498 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-03 17:01:52,498 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:52,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:53,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:53,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:53,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354158561]
[2025-03-03 17:01:53,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354158561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:53,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:53,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:01:53,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085571001]
[2025-03-03 17:01:53,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:53,542 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:01:53,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:53,543 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:01:53,543 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:01:53,543 INFO  L87              Difference]: Start difference. First operand 1690 states and 2530 transitions. Second operand  has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:54,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:54,814 INFO  L93              Difference]: Finished difference Result 5298 states and 7936 transitions.
[2025-03-03 17:01:54,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-03 17:01:54,814 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338
[2025-03-03 17:01:54,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:54,821 INFO  L225             Difference]: With dead ends: 5298
[2025-03-03 17:01:54,821 INFO  L226             Difference]: Without dead ends: 2634
[2025-03-03 17:01:54,824 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-03 17:01:54,825 INFO  L435           NwaCegarLoop]: 1812 mSDtfsCounter, 5453 mSDsluCounter, 8469 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5453 SdHoareTripleChecker+Valid, 10281 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:54,826 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5453 Valid, 10281 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 17:01:54,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2634 states.
[2025-03-03 17:01:54,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2580.
[2025-03-03 17:01:54,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2580 states, 2579 states have (on average 1.4990306320279179) internal successors, (3866), 2579 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:54,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3866 transitions.
[2025-03-03 17:01:54,860 INFO  L78                 Accepts]: Start accepts. Automaton has 2580 states and 3866 transitions. Word has length 338
[2025-03-03 17:01:54,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:54,861 INFO  L471      AbstractCegarLoop]: Abstraction has 2580 states and 3866 transitions.
[2025-03-03 17:01:54,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:54,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 2580 states and 3866 transitions.
[2025-03-03 17:01:54,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-03-03 17:01:54,864 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:54,864 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:54,865 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 17:01:54,865 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:54,865 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:54,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -2128272083, now seen corresponding path program 1 times
[2025-03-03 17:01:54,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:54,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070007990]
[2025-03-03 17:01:54,865 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:54,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:54,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-03 17:01:56,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-03 17:01:56,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:56,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:57,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:57,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:57,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070007990]
[2025-03-03 17:01:57,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070007990] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:57,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:57,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:01:57,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461461170]
[2025-03-03 17:01:57,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:57,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:01:57,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:57,074 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:01:57,074 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:01:57,074 INFO  L87              Difference]: Start difference. First operand 2580 states and 3866 transitions. Second operand  has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:57,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:57,447 INFO  L93              Difference]: Finished difference Result 4130 states and 6186 transitions.
[2025-03-03 17:01:57,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:01:57,448 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339
[2025-03-03 17:01:57,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:57,454 INFO  L225             Difference]: With dead ends: 4130
[2025-03-03 17:01:57,455 INFO  L226             Difference]: Without dead ends: 2580
[2025-03-03 17:01:57,456 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:01:57,457 INFO  L435           NwaCegarLoop]: 1313 mSDtfsCounter, 873 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:57,458 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 3019 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 17:01:57,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2580 states.
[2025-03-03 17:01:57,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2580.
[2025-03-03 17:01:57,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2580 states, 2579 states have (on average 1.498255137650252) internal successors, (3864), 2579 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:57,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3864 transitions.
[2025-03-03 17:01:57,492 INFO  L78                 Accepts]: Start accepts. Automaton has 2580 states and 3864 transitions. Word has length 339
[2025-03-03 17:01:57,492 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:01:57,492 INFO  L471      AbstractCegarLoop]: Abstraction has 2580 states and 3864 transitions.
[2025-03-03 17:01:57,493 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:57,493 INFO  L276                IsEmpty]: Start isEmpty. Operand 2580 states and 3864 transitions.
[2025-03-03 17:01:57,495 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 341
[2025-03-03 17:01:57,495 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:01:57,496 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:01:57,496 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 17:01:57,496 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:01:57,496 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:01:57,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 232311083, now seen corresponding path program 1 times
[2025-03-03 17:01:57,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:01:57,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210069426]
[2025-03-03 17:01:57,498 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:01:57,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:01:57,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes.
[2025-03-03 17:01:58,728 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements.
[2025-03-03 17:01:58,729 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:01:58,729 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:01:59,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:01:59,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:01:59,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210069426]
[2025-03-03 17:01:59,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210069426] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:01:59,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:01:59,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:01:59,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455049822]
[2025-03-03 17:01:59,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:01:59,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:01:59,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:01:59,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:01:59,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:01:59,289 INFO  L87              Difference]: Start difference. First operand 2580 states and 3864 transitions. Second operand  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:01:59,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:01:59,988 INFO  L93              Difference]: Finished difference Result 5664 states and 8479 transitions.
[2025-03-03 17:01:59,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 17:01:59,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340
[2025-03-03 17:01:59,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:01:59,994 INFO  L225             Difference]: With dead ends: 5664
[2025-03-03 17:01:59,994 INFO  L226             Difference]: Without dead ends: 2580
[2025-03-03 17:01:59,997 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:01:59,997 INFO  L435           NwaCegarLoop]: 1816 mSDtfsCounter, 1737 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:01:59,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 5785 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:02:00,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2580 states.
[2025-03-03 17:02:00,020 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1690.
[2025-03-03 17:02:00,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1690 states, 1689 states have (on average 1.4955595026642985) internal successors, (2526), 1689 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:00,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2526 transitions.
[2025-03-03 17:02:00,024 INFO  L78                 Accepts]: Start accepts. Automaton has 1690 states and 2526 transitions. Word has length 340
[2025-03-03 17:02:00,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:00,025 INFO  L471      AbstractCegarLoop]: Abstraction has 1690 states and 2526 transitions.
[2025-03-03 17:02:00,026 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:00,026 INFO  L276                IsEmpty]: Start isEmpty. Operand 1690 states and 2526 transitions.
[2025-03-03 17:02:00,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 341
[2025-03-03 17:02:00,027 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:00,027 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:00,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 17:02:00,028 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:00,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:00,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -495005286, now seen corresponding path program 1 times
[2025-03-03 17:02:00,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:00,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477993438]
[2025-03-03 17:02:00,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:00,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:00,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes.
[2025-03-03 17:02:01,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements.
[2025-03-03 17:02:01,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:01,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:02,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:02,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:02,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477993438]
[2025-03-03 17:02:02,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477993438] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:02,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:02,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 17:02:02,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827558374]
[2025-03-03 17:02:02,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:02,127 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 17:02:02,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:02,127 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 17:02:02,127 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:02,127 INFO  L87              Difference]: Start difference. First operand 1690 states and 2526 transitions. Second operand  has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:02,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:02,936 INFO  L93              Difference]: Finished difference Result 2799 states and 4182 transitions.
[2025-03-03 17:02:02,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 17:02:02,937 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340
[2025-03-03 17:02:02,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:02,941 INFO  L225             Difference]: With dead ends: 2799
[2025-03-03 17:02:02,941 INFO  L226             Difference]: Without dead ends: 1698
[2025-03-03 17:02:02,942 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-03-03 17:02:02,942 INFO  L435           NwaCegarLoop]: 1078 mSDtfsCounter, 1299 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:02,942 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 4616 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 17:02:02,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1698 states.
[2025-03-03 17:02:02,957 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1696.
[2025-03-03 17:02:02,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1696 states, 1695 states have (on average 1.4938053097345132) internal successors, (2532), 1695 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:02,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2532 transitions.
[2025-03-03 17:02:02,962 INFO  L78                 Accepts]: Start accepts. Automaton has 1696 states and 2532 transitions. Word has length 340
[2025-03-03 17:02:02,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:02,962 INFO  L471      AbstractCegarLoop]: Abstraction has 1696 states and 2532 transitions.
[2025-03-03 17:02:02,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:02,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 1696 states and 2532 transitions.
[2025-03-03 17:02:02,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-03 17:02:02,964 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:02,964 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:02,964 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 17:02:02,964 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:02,965 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:02,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -1274148461, now seen corresponding path program 1 times
[2025-03-03 17:02:02,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:02,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694112047]
[2025-03-03 17:02:02,965 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:02,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:03,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-03 17:02:03,466 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-03 17:02:03,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:03,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:04,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:04,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:04,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694112047]
[2025-03-03 17:02:04,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694112047] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:04,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:04,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:04,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321769689]
[2025-03-03 17:02:04,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:04,313 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:04,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:04,313 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:04,314 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:04,314 INFO  L87              Difference]: Start difference. First operand 1696 states and 2532 transitions. Second operand  has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:05,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:05,008 INFO  L93              Difference]: Finished difference Result 4708 states and 7027 transitions.
[2025-03-03 17:02:05,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:02:05,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 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 341
[2025-03-03 17:02:05,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:05,017 INFO  L225             Difference]: With dead ends: 4708
[2025-03-03 17:02:05,017 INFO  L226             Difference]: Without dead ends: 3160
[2025-03-03 17:02:05,019 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-03-03 17:02:05,019 INFO  L435           NwaCegarLoop]: 1713 mSDtfsCounter, 3230 mSDsluCounter, 8145 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3230 SdHoareTripleChecker+Valid, 9858 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:05,019 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3230 Valid, 9858 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:02:05,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3160 states.
[2025-03-03 17:02:05,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 2754.
[2025-03-03 17:02:05,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2754 states, 2753 states have (on average 1.4950962586269525) internal successors, (4116), 2753 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:05,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 4116 transitions.
[2025-03-03 17:02:05,058 INFO  L78                 Accepts]: Start accepts. Automaton has 2754 states and 4116 transitions. Word has length 341
[2025-03-03 17:02:05,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:05,058 INFO  L471      AbstractCegarLoop]: Abstraction has 2754 states and 4116 transitions.
[2025-03-03 17:02:05,061 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:05,061 INFO  L276                IsEmpty]: Start isEmpty. Operand 2754 states and 4116 transitions.
[2025-03-03 17:02:05,063 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 343
[2025-03-03 17:02:05,067 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:05,068 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:05,068 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 17:02:05,068 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:05,068 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:05,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 1129093219, now seen corresponding path program 1 times
[2025-03-03 17:02:05,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:05,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877450730]
[2025-03-03 17:02:05,069 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:05,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:05,130 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes.
[2025-03-03 17:02:05,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements.
[2025-03-03 17:02:05,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:05,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:06,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:06,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:06,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877450730]
[2025-03-03 17:02:06,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877450730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:06,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:06,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 17:02:06,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176165359]
[2025-03-03 17:02:06,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:06,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 17:02:06,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:06,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 17:02:06,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:06,576 INFO  L87              Difference]: Start difference. First operand 2754 states and 4116 transitions. Second operand  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:07,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:07,331 INFO  L93              Difference]: Finished difference Result 6447 states and 9640 transitions.
[2025-03-03 17:02:07,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 17:02:07,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 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 342
[2025-03-03 17:02:07,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:07,344 INFO  L225             Difference]: With dead ends: 6447
[2025-03-03 17:02:07,344 INFO  L226             Difference]: Without dead ends: 4624
[2025-03-03 17:02:07,347 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-03 17:02:07,350 INFO  L435           NwaCegarLoop]: 1208 mSDtfsCounter, 2662 mSDsluCounter, 4788 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 5996 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:07,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 5996 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:02:07,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4624 states.
[2025-03-03 17:02:07,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4624 to 4520.
[2025-03-03 17:02:07,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4520 states, 4519 states have (on average 1.4967913255144945) internal successors, (6764), 4519 states have internal predecessors, (6764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:07,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6764 transitions.
[2025-03-03 17:02:07,403 INFO  L78                 Accepts]: Start accepts. Automaton has 4520 states and 6764 transitions. Word has length 342
[2025-03-03 17:02:07,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:07,404 INFO  L471      AbstractCegarLoop]: Abstraction has 4520 states and 6764 transitions.
[2025-03-03 17:02:07,404 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:07,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 4520 states and 6764 transitions.
[2025-03-03 17:02:07,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-03 17:02:07,408 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:07,408 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:07,408 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 17:02:07,408 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:07,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:07,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -224691127, now seen corresponding path program 1 times
[2025-03-03 17:02:07,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:07,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108720956]
[2025-03-03 17:02:07,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:07,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:07,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-03 17:02:08,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-03 17:02:08,831 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:08,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:09,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:09,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:09,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108720956]
[2025-03-03 17:02:09,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108720956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:09,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:09,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:09,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59073895]
[2025-03-03 17:02:09,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:09,897 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:09,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:09,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:09,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:09,898 INFO  L87              Difference]: Start difference. First operand 4520 states and 6764 transitions. Second operand  has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:11,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:11,302 INFO  L93              Difference]: Finished difference Result 10162 states and 15201 transitions.
[2025-03-03 17:02:11,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:02:11,302 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 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 343
[2025-03-03 17:02:11,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:11,313 INFO  L225             Difference]: With dead ends: 10162
[2025-03-03 17:02:11,313 INFO  L226             Difference]: Without dead ends: 6858
[2025-03-03 17:02:11,317 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-03-03 17:02:11,317 INFO  L435           NwaCegarLoop]: 1978 mSDtfsCounter, 2571 mSDsluCounter, 7792 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 9770 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:11,317 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 9770 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4407 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 17:02:11,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6858 states.
[2025-03-03 17:02:11,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6858 to 4520.
[2025-03-03 17:02:11,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4520 states, 4519 states have (on average 1.4967913255144945) internal successors, (6764), 4519 states have internal predecessors, (6764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:11,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6764 transitions.
[2025-03-03 17:02:11,365 INFO  L78                 Accepts]: Start accepts. Automaton has 4520 states and 6764 transitions. Word has length 343
[2025-03-03 17:02:11,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:11,366 INFO  L471      AbstractCegarLoop]: Abstraction has 4520 states and 6764 transitions.
[2025-03-03 17:02:11,366 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:11,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 4520 states and 6764 transitions.
[2025-03-03 17:02:11,369 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-03 17:02:11,369 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:11,369 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:11,369 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 17:02:11,369 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:11,370 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:11,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -30706399, now seen corresponding path program 1 times
[2025-03-03 17:02:11,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:11,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246385992]
[2025-03-03 17:02:11,370 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:11,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:11,441 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-03 17:02:12,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-03 17:02:12,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:12,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:13,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:13,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:13,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246385992]
[2025-03-03 17:02:13,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246385992] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:13,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:13,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 17:02:13,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165047508]
[2025-03-03 17:02:13,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:13,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 17:02:13,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:13,425 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 17:02:13,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:02:13,425 INFO  L87              Difference]: Start difference. First operand 4520 states and 6764 transitions. Second operand  has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:14,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:14,215 INFO  L93              Difference]: Finished difference Result 13866 states and 20735 transitions.
[2025-03-03 17:02:14,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 17:02:14,216 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 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 343
[2025-03-03 17:02:14,216 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:14,231 INFO  L225             Difference]: With dead ends: 13866
[2025-03-03 17:02:14,231 INFO  L226             Difference]: Without dead ends: 11358
[2025-03-03 17:02:14,236 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:14,237 INFO  L435           NwaCegarLoop]: 1684 mSDtfsCounter, 1453 mSDsluCounter, 5759 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 7443 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:14,237 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 7443 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:02:14,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11358 states.
[2025-03-03 17:02:14,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 8168.
[2025-03-03 17:02:14,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8168 states, 8167 states have (on average 1.4955307946614425) internal successors, (12214), 8167 states have internal predecessors, (12214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:14,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8168 states to 8168 states and 12214 transitions.
[2025-03-03 17:02:14,318 INFO  L78                 Accepts]: Start accepts. Automaton has 8168 states and 12214 transitions. Word has length 343
[2025-03-03 17:02:14,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:14,318 INFO  L471      AbstractCegarLoop]: Abstraction has 8168 states and 12214 transitions.
[2025-03-03 17:02:14,318 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:14,318 INFO  L276                IsEmpty]: Start isEmpty. Operand 8168 states and 12214 transitions.
[2025-03-03 17:02:14,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-03-03 17:02:14,324 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:14,324 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:14,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 17:02:14,324 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:14,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:14,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 1085537414, now seen corresponding path program 1 times
[2025-03-03 17:02:14,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:14,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030961333]
[2025-03-03 17:02:14,325 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:14,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:14,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-03-03 17:02:15,118 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-03-03 17:02:15,118 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:15,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:16,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:16,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:16,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030961333]
[2025-03-03 17:02:16,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030961333] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:16,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:16,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 17:02:16,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003981795]
[2025-03-03 17:02:16,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:16,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 17:02:16,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:16,215 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 17:02:16,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-03-03 17:02:16,216 INFO  L87              Difference]: Start difference. First operand 8168 states and 12214 transitions. Second operand  has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:16,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:16,979 INFO  L93              Difference]: Finished difference Result 16630 states and 24854 transitions.
[2025-03-03 17:02:16,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 17:02:16,980 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 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 344
[2025-03-03 17:02:16,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:16,992 INFO  L225             Difference]: With dead ends: 16630
[2025-03-03 17:02:16,992 INFO  L226             Difference]: Without dead ends: 12318
[2025-03-03 17:02:16,998 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210
[2025-03-03 17:02:16,998 INFO  L435           NwaCegarLoop]: 1651 mSDtfsCounter, 3787 mSDsluCounter, 7991 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 9642 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:16,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 9642 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:02:17,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12318 states.
[2025-03-03 17:02:17,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 11988.
[2025-03-03 17:02:17,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11988 states, 11987 states have (on average 1.4947860181863686) internal successors, (17918), 11987 states have internal predecessors, (17918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:17,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 17918 transitions.
[2025-03-03 17:02:17,091 INFO  L78                 Accepts]: Start accepts. Automaton has 11988 states and 17918 transitions. Word has length 344
[2025-03-03 17:02:17,091 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:17,091 INFO  L471      AbstractCegarLoop]: Abstraction has 11988 states and 17918 transitions.
[2025-03-03 17:02:17,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:17,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 11988 states and 17918 transitions.
[2025-03-03 17:02:17,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 17:02:17,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:17,099 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:17,099 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 17:02:17,099 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:17,100 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:17,100 INFO  L85        PathProgramCache]: Analyzing trace with hash 1489929056, now seen corresponding path program 1 times
[2025-03-03 17:02:17,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:17,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583878731]
[2025-03-03 17:02:17,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:17,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:17,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 17:02:17,753 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 17:02:17,753 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:17,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:18,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:18,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:18,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583878731]
[2025-03-03 17:02:18,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583878731] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:18,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:18,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:02:18,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340098265]
[2025-03-03 17:02:18,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:18,371 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:02:18,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:18,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:02:18,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:02:18,372 INFO  L87              Difference]: Start difference. First operand 11988 states and 17918 transitions. Second operand  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:18,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:18,728 INFO  L93              Difference]: Finished difference Result 18210 states and 27216 transitions.
[2025-03-03 17:02:18,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 17:02:18,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345
[2025-03-03 17:02:18,729 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:18,742 INFO  L225             Difference]: With dead ends: 18210
[2025-03-03 17:02:18,742 INFO  L226             Difference]: Without dead ends: 11988
[2025-03-03 17:02:18,749 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:18,750 INFO  L435           NwaCegarLoop]: 1306 mSDtfsCounter, 1321 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:18,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 3927 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 17:02:18,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11988 states.
[2025-03-03 17:02:18,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 8168.
[2025-03-03 17:02:18,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8168 states, 8167 states have (on average 1.4952859066976858) internal successors, (12212), 8167 states have internal predecessors, (12212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:18,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8168 states to 8168 states and 12212 transitions.
[2025-03-03 17:02:18,824 INFO  L78                 Accepts]: Start accepts. Automaton has 8168 states and 12212 transitions. Word has length 345
[2025-03-03 17:02:18,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:18,824 INFO  L471      AbstractCegarLoop]: Abstraction has 8168 states and 12212 transitions.
[2025-03-03 17:02:18,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:18,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 8168 states and 12212 transitions.
[2025-03-03 17:02:18,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 17:02:18,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:18,830 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:18,830 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 17:02:18,830 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:18,830 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:18,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 1636042778, now seen corresponding path program 1 times
[2025-03-03 17:02:18,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:18,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005606272]
[2025-03-03 17:02:18,831 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:18,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:18,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 17:02:19,678 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 17:02:19,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:19,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:20,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:20,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:20,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005606272]
[2025-03-03 17:02:20,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005606272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:20,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:20,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:20,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429057992]
[2025-03-03 17:02:20,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:20,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:20,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:20,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:20,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:20,408 INFO  L87              Difference]: Start difference. First operand 8168 states and 12212 transitions. Second operand  has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:21,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:21,184 INFO  L93              Difference]: Finished difference Result 12484 states and 18663 transitions.
[2025-03-03 17:02:21,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 17:02:21,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345
[2025-03-03 17:02:21,185 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:21,191 INFO  L225             Difference]: With dead ends: 12484
[2025-03-03 17:02:21,191 INFO  L226             Difference]: Without dead ends: 8176
[2025-03-03 17:02:21,195 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2025-03-03 17:02:21,196 INFO  L435           NwaCegarLoop]: 1187 mSDtfsCounter, 2597 mSDsluCounter, 4776 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:21,197 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 5963 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:02:21,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8176 states.
[2025-03-03 17:02:21,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8174.
[2025-03-03 17:02:21,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8174 states, 8173 states have (on average 1.4949223051511074) internal successors, (12218), 8173 states have internal predecessors, (12218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:21,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8174 states to 8174 states and 12218 transitions.
[2025-03-03 17:02:21,263 INFO  L78                 Accepts]: Start accepts. Automaton has 8174 states and 12218 transitions. Word has length 345
[2025-03-03 17:02:21,264 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:21,264 INFO  L471      AbstractCegarLoop]: Abstraction has 8174 states and 12218 transitions.
[2025-03-03 17:02:21,264 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:21,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 8174 states and 12218 transitions.
[2025-03-03 17:02:21,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2025-03-03 17:02:21,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:21,268 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:21,269 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 17:02:21,269 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:21,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:21,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -273726196, now seen corresponding path program 1 times
[2025-03-03 17:02:21,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:21,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586450883]
[2025-03-03 17:02:21,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:21,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:21,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-03-03 17:02:21,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-03-03 17:02:21,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:21,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:22,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:22,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:22,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586450883]
[2025-03-03 17:02:22,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586450883] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:22,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:22,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 17:02:22,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215473019]
[2025-03-03 17:02:22,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:22,155 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 17:02:22,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:22,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 17:02:22,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:02:22,156 INFO  L87              Difference]: Start difference. First operand 8174 states and 12218 transitions. Second operand  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:22,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:22,464 INFO  L93              Difference]: Finished difference Result 12496 states and 18675 transitions.
[2025-03-03 17:02:22,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 17:02:22,465 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 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 346
[2025-03-03 17:02:22,465 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:22,470 INFO  L225             Difference]: With dead ends: 12496
[2025-03-03 17:02:22,470 INFO  L226             Difference]: Without dead ends: 8180
[2025-03-03 17:02:22,474 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 17:02:22,474 INFO  L435           NwaCegarLoop]: 1317 mSDtfsCounter, 0 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:22,474 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3945 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 17:02:22,477 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8180 states.
[2025-03-03 17:02:22,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180.
[2025-03-03 17:02:22,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8180 states, 8179 states have (on average 1.4945592370705465) internal successors, (12224), 8179 states have internal predecessors, (12224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:22,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12224 transitions.
[2025-03-03 17:02:22,536 INFO  L78                 Accepts]: Start accepts. Automaton has 8180 states and 12224 transitions. Word has length 346
[2025-03-03 17:02:22,537 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:22,537 INFO  L471      AbstractCegarLoop]: Abstraction has 8180 states and 12224 transitions.
[2025-03-03 17:02:22,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:22,537 INFO  L276                IsEmpty]: Start isEmpty. Operand 8180 states and 12224 transitions.
[2025-03-03 17:02:22,542 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-03 17:02:22,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:22,542 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:22,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 17:02:22,542 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:22,543 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:22,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -287285989, now seen corresponding path program 1 times
[2025-03-03 17:02:22,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:22,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787919594]
[2025-03-03 17:02:22,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:22,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:22,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-03 17:02:23,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-03 17:02:23,998 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:23,998 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:26,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:26,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:26,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787919594]
[2025-03-03 17:02:26,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787919594] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:26,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:26,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 17:02:26,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369986264]
[2025-03-03 17:02:26,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:26,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 17:02:26,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:26,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 17:02:26,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-03-03 17:02:26,063 INFO  L87              Difference]: Start difference. First operand 8180 states and 12224 transitions. Second operand  has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:26,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:26,772 INFO  L93              Difference]: Finished difference Result 22018 states and 32908 transitions.
[2025-03-03 17:02:26,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 17:02:26,772 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-03 17:02:26,773 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:26,778 INFO  L225             Difference]: With dead ends: 22018
[2025-03-03 17:02:26,778 INFO  L226             Difference]: Without dead ends: 9532
[2025-03-03 17:02:26,784 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2025-03-03 17:02:26,784 INFO  L435           NwaCegarLoop]: 1292 mSDtfsCounter, 2579 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:26,784 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 6645 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:02:26,788 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9532 states.
[2025-03-03 17:02:26,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9532 to 9308.
[2025-03-03 17:02:26,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9308 states, 9307 states have (on average 1.4947888685935318) internal successors, (13912), 9307 states have internal predecessors, (13912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:26,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 13912 transitions.
[2025-03-03 17:02:26,849 INFO  L78                 Accepts]: Start accepts. Automaton has 9308 states and 13912 transitions. Word has length 347
[2025-03-03 17:02:26,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:26,849 INFO  L471      AbstractCegarLoop]: Abstraction has 9308 states and 13912 transitions.
[2025-03-03 17:02:26,849 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:26,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 9308 states and 13912 transitions.
[2025-03-03 17:02:26,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:26,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:26,855 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:26,855 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 17:02:26,855 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:26,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:26,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -868301, now seen corresponding path program 1 times
[2025-03-03 17:02:26,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:26,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292875065]
[2025-03-03 17:02:26,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:26,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:26,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:28,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:28,090 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:28,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:28,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:28,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:28,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292875065]
[2025-03-03 17:02:28,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292875065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:28,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:28,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:28,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120922882]
[2025-03-03 17:02:28,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:28,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:28,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:28,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:28,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:28,614 INFO  L87              Difference]: Start difference. First operand 9308 states and 13912 transitions. Second operand  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:30,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:30,094 INFO  L93              Difference]: Finished difference Result 20746 states and 30980 transitions.
[2025-03-03 17:02:30,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:02:30,095 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:30,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:30,106 INFO  L225             Difference]: With dead ends: 20746
[2025-03-03 17:02:30,106 INFO  L226             Difference]: Without dead ends: 15850
[2025-03-03 17:02:30,112 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 17:02:30,112 INFO  L435           NwaCegarLoop]: 943 mSDtfsCounter, 2128 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 5646 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:30,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 5646 Invalid, 3872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 17:02:30,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15850 states.
[2025-03-03 17:02:30,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15850 to 15676.
[2025-03-03 17:02:30,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15676 states, 15675 states have (on average 1.4940988835725677) internal successors, (23420), 15675 states have internal predecessors, (23420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:30,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15676 states to 15676 states and 23420 transitions.
[2025-03-03 17:02:30,224 INFO  L78                 Accepts]: Start accepts. Automaton has 15676 states and 23420 transitions. Word has length 348
[2025-03-03 17:02:30,224 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:30,224 INFO  L471      AbstractCegarLoop]: Abstraction has 15676 states and 23420 transitions.
[2025-03-03 17:02:30,224 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:30,224 INFO  L276                IsEmpty]: Start isEmpty. Operand 15676 states and 23420 transitions.
[2025-03-03 17:02:30,231 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:30,231 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:30,232 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:30,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 17:02:30,232 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:30,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:30,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 1989314534, now seen corresponding path program 1 times
[2025-03-03 17:02:30,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:30,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379710746]
[2025-03-03 17:02:30,232 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:30,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:30,290 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:31,900 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:31,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:31,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:32,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:32,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:32,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379710746]
[2025-03-03 17:02:32,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379710746] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:32,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:32,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 17:02:32,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527275707]
[2025-03-03 17:02:32,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:32,471 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 17:02:32,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:32,471 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 17:02:32,471 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-03 17:02:32,471 INFO  L87              Difference]: Start difference. First operand 15676 states and 23420 transitions. Second operand  has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:33,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:33,961 INFO  L93              Difference]: Finished difference Result 23917 states and 35712 transitions.
[2025-03-03 17:02:33,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 17:02:33,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:33,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:33,974 INFO  L225             Difference]: With dead ends: 23917
[2025-03-03 17:02:33,974 INFO  L226             Difference]: Without dead ends: 15848
[2025-03-03 17:02:33,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2025-03-03 17:02:33,983 INFO  L435           NwaCegarLoop]: 1024 mSDtfsCounter, 4567 mSDsluCounter, 5026 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 6050 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:33,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 6050 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 17:02:33,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15848 states.
[2025-03-03 17:02:34,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15848 to 15676.
[2025-03-03 17:02:34,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15676 states, 15675 states have (on average 1.4939712918660286) internal successors, (23418), 15675 states have internal predecessors, (23418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:34,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15676 states to 15676 states and 23418 transitions.
[2025-03-03 17:02:34,101 INFO  L78                 Accepts]: Start accepts. Automaton has 15676 states and 23418 transitions. Word has length 348
[2025-03-03 17:02:34,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:34,102 INFO  L471      AbstractCegarLoop]: Abstraction has 15676 states and 23418 transitions.
[2025-03-03 17:02:34,102 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:34,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 15676 states and 23418 transitions.
[2025-03-03 17:02:34,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:34,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:34,110 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:34,110 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 17:02:34,110 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:34,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:34,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -550804242, now seen corresponding path program 1 times
[2025-03-03 17:02:34,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:34,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811796890]
[2025-03-03 17:02:34,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:34,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:34,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:35,369 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:35,369 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:35,369 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:35,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:35,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:35,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811796890]
[2025-03-03 17:02:35,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811796890] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:35,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:35,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:35,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586859863]
[2025-03-03 17:02:35,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:35,776 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:35,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:35,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:35,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:35,777 INFO  L87              Difference]: Start difference. First operand 15676 states and 23418 transitions. Second operand  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:37,090 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:37,091 INFO  L93              Difference]: Finished difference Result 30293 states and 45232 transitions.
[2025-03-03 17:02:37,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:02:37,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:37,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:37,110 INFO  L225             Difference]: With dead ends: 30293
[2025-03-03 17:02:37,110 INFO  L226             Difference]: Without dead ends: 22212
[2025-03-03 17:02:37,119 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 17:02:37,120 INFO  L435           NwaCegarLoop]: 1570 mSDtfsCounter, 2122 mSDsluCounter, 7341 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 8911 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:37,120 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 8911 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 17:02:37,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22212 states.
[2025-03-03 17:02:37,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22212 to 22042.
[2025-03-03 17:02:37,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22042 states, 22041 states have (on average 1.4936708860759493) internal successors, (32922), 22041 states have internal predecessors, (32922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:37,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22042 states to 22042 states and 32922 transitions.
[2025-03-03 17:02:37,269 INFO  L78                 Accepts]: Start accepts. Automaton has 22042 states and 32922 transitions. Word has length 348
[2025-03-03 17:02:37,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:37,269 INFO  L471      AbstractCegarLoop]: Abstraction has 22042 states and 32922 transitions.
[2025-03-03 17:02:37,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:37,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 22042 states and 32922 transitions.
[2025-03-03 17:02:37,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:37,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:37,280 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:37,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 17:02:37,280 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:37,281 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:37,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439378593, now seen corresponding path program 1 times
[2025-03-03 17:02:37,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:37,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418518410]
[2025-03-03 17:02:37,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:37,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:37,337 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:38,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:38,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:38,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:39,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:39,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:39,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418518410]
[2025-03-03 17:02:39,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418518410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:39,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:39,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 17:02:39,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342753661]
[2025-03-03 17:02:39,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:39,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 17:02:39,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:39,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 17:02:39,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:39,111 INFO  L87              Difference]: Start difference. First operand 22042 states and 32922 transitions. Second operand  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:40,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:40,032 INFO  L93              Difference]: Finished difference Result 43174 states and 64468 transitions.
[2025-03-03 17:02:40,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 17:02:40,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:40,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:40,051 INFO  L225             Difference]: With dead ends: 43174
[2025-03-03 17:02:40,051 INFO  L226             Difference]: Without dead ends: 22250
[2025-03-03 17:02:40,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2025-03-03 17:02:40,062 INFO  L435           NwaCegarLoop]: 1171 mSDtfsCounter, 1753 mSDsluCounter, 5844 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 7015 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:40,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 7015 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 17:02:40,072 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22250 states.
[2025-03-03 17:02:40,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 22170.
[2025-03-03 17:02:40,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22170 states, 22169 states have (on average 1.4915422436735983) internal successors, (33066), 22169 states have internal predecessors, (33066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:40,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22170 states to 22170 states and 33066 transitions.
[2025-03-03 17:02:40,223 INFO  L78                 Accepts]: Start accepts. Automaton has 22170 states and 33066 transitions. Word has length 348
[2025-03-03 17:02:40,223 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:40,223 INFO  L471      AbstractCegarLoop]: Abstraction has 22170 states and 33066 transitions.
[2025-03-03 17:02:40,223 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:40,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 22170 states and 33066 transitions.
[2025-03-03 17:02:40,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:40,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:40,232 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:40,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 17:02:40,232 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:40,233 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:40,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -570466857, now seen corresponding path program 1 times
[2025-03-03 17:02:40,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:40,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237269960]
[2025-03-03 17:02:40,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:40,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:40,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:41,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:41,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:41,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:41,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:41,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:41,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237269960]
[2025-03-03 17:02:41,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237269960] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:41,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:41,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 17:02:41,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801261429]
[2025-03-03 17:02:41,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:41,826 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 17:02:41,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:41,827 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 17:02:41,827 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:41,827 INFO  L87              Difference]: Start difference. First operand 22170 states and 33066 transitions. Second operand  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:42,579 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:42,579 INFO  L93              Difference]: Finished difference Result 43494 states and 64860 transitions.
[2025-03-03 17:02:42,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 17:02:42,580 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:42,580 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:42,600 INFO  L225             Difference]: With dead ends: 43494
[2025-03-03 17:02:42,600 INFO  L226             Difference]: Without dead ends: 22330
[2025-03-03 17:02:42,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:42,616 INFO  L435           NwaCegarLoop]: 1196 mSDtfsCounter, 1522 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 5973 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:42,616 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 5973 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 17:02:42,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22330 states.
[2025-03-03 17:02:42,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22330 to 22330.
[2025-03-03 17:02:42,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22330 states, 22329 states have (on average 1.489453177482198) internal successors, (33258), 22329 states have internal predecessors, (33258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:42,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22330 states to 22330 states and 33258 transitions.
[2025-03-03 17:02:42,858 INFO  L78                 Accepts]: Start accepts. Automaton has 22330 states and 33258 transitions. Word has length 348
[2025-03-03 17:02:42,858 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:42,859 INFO  L471      AbstractCegarLoop]: Abstraction has 22330 states and 33258 transitions.
[2025-03-03 17:02:42,859 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:42,859 INFO  L276                IsEmpty]: Start isEmpty. Operand 22330 states and 33258 transitions.
[2025-03-03 17:02:42,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-03 17:02:42,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:42,871 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:42,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 17:02:42,871 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:42,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:42,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -309449939, now seen corresponding path program 1 times
[2025-03-03 17:02:42,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:42,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527051166]
[2025-03-03 17:02:42,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:42,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:42,941 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-03 17:02:44,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-03 17:02:44,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:44,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:45,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:45,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:45,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527051166]
[2025-03-03 17:02:45,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527051166] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:45,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:45,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 17:02:45,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235200052]
[2025-03-03 17:02:45,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:45,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 17:02:45,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:45,640 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 17:02:45,640 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 17:02:45,641 INFO  L87              Difference]: Start difference. First operand 22330 states and 33258 transitions. Second operand  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:46,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:46,344 INFO  L93              Difference]: Finished difference Result 60846 states and 90722 transitions.
[2025-03-03 17:02:46,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 17:02:46,345 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-03 17:02:46,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:46,381 INFO  L225             Difference]: With dead ends: 60846
[2025-03-03 17:02:46,381 INFO  L226             Difference]: Without dead ends: 40526
[2025-03-03 17:02:46,402 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 17:02:46,402 INFO  L435           NwaCegarLoop]: 1668 mSDtfsCounter, 786 mSDsluCounter, 7971 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 9639 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:46,403 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 9639 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 17:02:46,426 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40526 states.
[2025-03-03 17:02:46,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40526 to 38626.
[2025-03-03 17:02:46,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38626 states, 38625 states have (on average 1.4911067961165048) internal successors, (57594), 38625 states have internal predecessors, (57594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:46,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38626 states to 38626 states and 57594 transitions.
[2025-03-03 17:02:46,715 INFO  L78                 Accepts]: Start accepts. Automaton has 38626 states and 57594 transitions. Word has length 348
[2025-03-03 17:02:46,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:46,715 INFO  L471      AbstractCegarLoop]: Abstraction has 38626 states and 57594 transitions.
[2025-03-03 17:02:46,716 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:46,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 38626 states and 57594 transitions.
[2025-03-03 17:02:46,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-03-03 17:02:46,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:46,732 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:46,732 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 17:02:46,732 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:46,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:46,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 978566986, now seen corresponding path program 1 times
[2025-03-03 17:02:46,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:46,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014783081]
[2025-03-03 17:02:46,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:46,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:46,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-03 17:02:47,720 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-03 17:02:47,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:47,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 17:02:48,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 17:02:48,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 17:02:48,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014783081]
[2025-03-03 17:02:48,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014783081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 17:02:48,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 17:02:48,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 17:02:48,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075791357]
[2025-03-03 17:02:48,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 17:02:48,181 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 17:02:48,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 17:02:48,181 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 17:02:48,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 17:02:48,181 INFO  L87              Difference]: Start difference. First operand 38626 states and 57594 transitions. Second operand  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:48,697 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 17:02:48,697 INFO  L93              Difference]: Finished difference Result 59810 states and 89148 transitions.
[2025-03-03 17:02:48,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 17:02:48,698 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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 349
[2025-03-03 17:02:48,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 17:02:48,730 INFO  L225             Difference]: With dead ends: 59810
[2025-03-03 17:02:48,730 INFO  L226             Difference]: Without dead ends: 38626
[2025-03-03 17:02:48,751 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 17:02:48,752 INFO  L435           NwaCegarLoop]: 1179 mSDtfsCounter, 1335 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 17:02:48,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 3115 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 17:02:48,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38626 states.
[2025-03-03 17:02:48,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38626 to 21254.
[2025-03-03 17:02:48,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21254 states, 21253 states have (on average 1.4878840634263397) internal successors, (31622), 21253 states have internal predecessors, (31622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:48,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21254 states to 21254 states and 31622 transitions.
[2025-03-03 17:02:48,972 INFO  L78                 Accepts]: Start accepts. Automaton has 21254 states and 31622 transitions. Word has length 349
[2025-03-03 17:02:48,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 17:02:48,973 INFO  L471      AbstractCegarLoop]: Abstraction has 21254 states and 31622 transitions.
[2025-03-03 17:02:48,973 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 17:02:48,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 21254 states and 31622 transitions.
[2025-03-03 17:02:48,982 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-03-03 17:02:48,983 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 17:02:48,983 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 17:02:48,983 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 17:02:48,983 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 17:02:48,983 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 17:02:48,983 INFO  L85        PathProgramCache]: Analyzing trace with hash 1796440473, now seen corresponding path program 1 times
[2025-03-03 17:02:48,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 17:02:48,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937452910]
[2025-03-03 17:02:48,983 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 17:02:48,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 17:02:49,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-03 17:02:49,703 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-03 17:02:49,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 17:02:49,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat