./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c59a07a72114fa018dd9402a01bfcfdf8aa22d82b0ff93edb1d3b6cc15f90161
[2025-02-06 02:40:07,677 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 02:40:07,683 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 02:40:07,684 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 02:40:07,685 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 02:40:07,685 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 02:40:07,686 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i
[2025-02-06 02:40:08,835 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54f4a5c98/e0599bf486cb485c9efcac6f53bd419c/FLAG97a8f8c5d
[2025-02-06 02:40:09,204 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 02:40:09,205 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i
[2025-02-06 02:40:09,226 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54f4a5c98/e0599bf486cb485c9efcac6f53bd419c/FLAG97a8f8c5d
[2025-02-06 02:40:09,431 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54f4a5c98/e0599bf486cb485c9efcac6f53bd419c
[2025-02-06 02:40:09,433 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 02:40:09,434 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 02:40:09,435 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 02:40:09,435 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 02:40:09,438 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 02:40:09,438 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:09,439 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09, skipping insertion in model container
[2025-02-06 02:40:09,439 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:09,462 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 02:40:09,566 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i[916,929]
[2025-02-06 02:40:09,766 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 02:40:09,776 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 02:40:09,787 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i[916,929]
[2025-02-06 02:40:09,911 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 02:40:09,924 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 02:40:09,924 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09 WrapperNode
[2025-02-06 02:40:09,925 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 02:40:09,926 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 02:40:09,926 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 02:40:09,926 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 02:40:09,933 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:09,952 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,038 INFO  L138                Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 772
[2025-02-06 02:40:10,038 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 02:40:10,039 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 02:40:10,039 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 02:40:10,039 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 02:40:10,047 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,047 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,079 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,195 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-06 02:40:10,195 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,196 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,216 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,221 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,230 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,237 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,254 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 02:40:10,257 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 02:40:10,257 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 02:40:10,257 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 02:40:10,258 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (1/1) ...
[2025-02-06 02:40:10,262 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 02:40:10,271 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 02:40:10,289 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-06 02:40:10,292 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-06 02:40:10,307 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 02:40:10,307 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 02:40:10,307 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 02:40:10,307 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 02:40:10,307 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 02:40:10,307 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 02:40:10,433 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 02:40:10,434 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 02:40:11,474 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~bitwise58#1;havoc property_#t~bitwise59#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short71#1;havoc property_#t~bitwise72#1;havoc property_#t~short73#1;
[2025-02-06 02:40:11,613 INFO  L?                        ?]: Removed 97 outVars from TransFormulas that were not future-live.
[2025-02-06 02:40:11,613 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 02:40:11,656 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 02:40:11,656 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 02:40:11,660 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:40:11 BoogieIcfgContainer
[2025-02-06 02:40:11,660 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 02:40:11,661 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 02:40:11,662 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 02:40:11,669 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 02:40:11,669 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:40:09" (1/3) ...
[2025-02-06 02:40:11,669 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce307fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:40:11, skipping insertion in model container
[2025-02-06 02:40:11,670 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:09" (2/3) ...
[2025-02-06 02:40:11,670 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce307fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:40:11, skipping insertion in model container
[2025-02-06 02:40:11,670 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:40:11" (3/3) ...
[2025-02-06 02:40:11,671 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-40.i
[2025-02-06 02:40:11,684 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 02:40:11,686 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-40.i that has 2 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 02:40:11,745 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 02:40:11,760 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;@5301c93a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 02:40:11,761 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 02:40:11,767 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 307 states, 240 states have (on average 1.5375) internal successors, (369), 241 states have internal predecessors, (369), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 02:40:11,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:11,789 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:11,790 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:11,790 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:11,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:11,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -1826685816, now seen corresponding path program 1 times
[2025-02-06 02:40:11,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:11,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074070017]
[2025-02-06 02:40:11,800 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:11,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:11,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:11,966 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:11,966 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:11,966 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:12,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked.
[2025-02-06 02:40:12,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:12,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074070017]
[2025-02-06 02:40:12,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074070017] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 02:40:12,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869791868]
[2025-02-06 02:40:12,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:12,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 02:40:12,380 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 02:40:12,385 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 02:40:12,388 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-06 02:40:12,615 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:12,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:12,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:12,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:12,766 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 02:40:12,783 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 02:40:12,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked.
[2025-02-06 02:40:12,857 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 02:40:12,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [869791868] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:12,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 02:40:12,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-06 02:40:12,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28668527]
[2025-02-06 02:40:12,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:12,863 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 02:40:12,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:12,878 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 02:40:12,878 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 02:40:12,881 INFO  L87              Difference]: Start difference. First operand  has 307 states, 240 states have (on average 1.5375) internal successors, (369), 241 states have internal predecessors, (369), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand  has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:40:12,977 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:12,978 INFO  L93              Difference]: Finished difference Result 608 states and 1053 transitions.
[2025-02-06 02:40:12,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 02:40:12,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 452
[2025-02-06 02:40:12,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:12,995 INFO  L225             Difference]: With dead ends: 608
[2025-02-06 02:40:12,996 INFO  L226             Difference]: Without dead ends: 304
[2025-02-06 02:40:13,000 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 02:40:13,004 INFO  L435           NwaCegarLoop]: 476 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:13,005 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:40:13,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2025-02-06 02:40:13,094 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304.
[2025-02-06 02:40:13,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 304 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 238 states have internal predecessors, (364), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-06 02:40:13,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 492 transitions.
[2025-02-06 02:40:13,103 INFO  L78                 Accepts]: Start accepts. Automaton has 304 states and 492 transitions. Word has length 452
[2025-02-06 02:40:13,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:13,104 INFO  L471      AbstractCegarLoop]: Abstraction has 304 states and 492 transitions.
[2025-02-06 02:40:13,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:40:13,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 304 states and 492 transitions.
[2025-02-06 02:40:13,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:13,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:13,110 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:13,119 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-06 02:40:13,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-06 02:40:13,316 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:13,316 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:13,316 INFO  L85        PathProgramCache]: Analyzing trace with hash 720695364, now seen corresponding path program 1 times
[2025-02-06 02:40:13,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:13,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654004777]
[2025-02-06 02:40:13,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:13,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:13,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:13,483 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:13,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:13,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:13,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:13,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:13,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654004777]
[2025-02-06 02:40:13,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654004777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:13,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:13,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:40:13,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979964640]
[2025-02-06 02:40:13,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:13,814 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:40:13,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:13,816 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:40:13,816 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:13,816 INFO  L87              Difference]: Start difference. First operand 304 states and 492 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:14,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:14,030 INFO  L93              Difference]: Finished difference Result 792 states and 1279 transitions.
[2025-02-06 02:40:14,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:40:14,038 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452
[2025-02-06 02:40:14,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:14,044 INFO  L225             Difference]: With dead ends: 792
[2025-02-06 02:40:14,044 INFO  L226             Difference]: Without dead ends: 491
[2025-02-06 02:40:14,047 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:14,048 INFO  L435           NwaCegarLoop]: 644 mSDtfsCounter, 290 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:14,048 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1088 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 02:40:14,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 491 states.
[2025-02-06 02:40:14,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488.
[2025-02-06 02:40:14,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 488 states, 396 states have (on average 1.5353535353535352) internal successors, (608), 397 states have internal predecessors, (608), 89 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (89), 88 states have call predecessors, (89), 89 states have call successors, (89)
[2025-02-06 02:40:14,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 786 transitions.
[2025-02-06 02:40:14,098 INFO  L78                 Accepts]: Start accepts. Automaton has 488 states and 786 transitions. Word has length 452
[2025-02-06 02:40:14,098 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:14,098 INFO  L471      AbstractCegarLoop]: Abstraction has 488 states and 786 transitions.
[2025-02-06 02:40:14,099 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:14,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 488 states and 786 transitions.
[2025-02-06 02:40:14,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:14,101 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:14,101 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:14,101 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 02:40:14,101 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:14,102 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:14,102 INFO  L85        PathProgramCache]: Analyzing trace with hash -1128841215, now seen corresponding path program 1 times
[2025-02-06 02:40:14,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:14,102 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044593023]
[2025-02-06 02:40:14,102 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:14,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:14,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:14,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:14,228 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:14,228 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:14,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:14,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:14,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044593023]
[2025-02-06 02:40:14,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044593023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:14,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:14,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:40:14,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264123655]
[2025-02-06 02:40:14,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:14,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:40:14,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:14,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:40:14,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:14,469 INFO  L87              Difference]: Start difference. First operand 488 states and 786 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:14,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:14,609 INFO  L93              Difference]: Finished difference Result 1400 states and 2255 transitions.
[2025-02-06 02:40:14,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:40:14,611 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452
[2025-02-06 02:40:14,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:14,622 INFO  L225             Difference]: With dead ends: 1400
[2025-02-06 02:40:14,623 INFO  L226             Difference]: Without dead ends: 915
[2025-02-06 02:40:14,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:14,625 INFO  L435           NwaCegarLoop]: 555 mSDtfsCounter, 333 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:14,626 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:40:14,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 915 states.
[2025-02-06 02:40:14,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 912.
[2025-02-06 02:40:14,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 912 states, 756 states have (on average 1.5423280423280423) internal successors, (1166), 759 states have internal predecessors, (1166), 151 states have call successors, (151), 4 states have call predecessors, (151), 4 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151)
[2025-02-06 02:40:14,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1468 transitions.
[2025-02-06 02:40:14,696 INFO  L78                 Accepts]: Start accepts. Automaton has 912 states and 1468 transitions. Word has length 452
[2025-02-06 02:40:14,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:14,696 INFO  L471      AbstractCegarLoop]: Abstraction has 912 states and 1468 transitions.
[2025-02-06 02:40:14,697 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:14,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 912 states and 1468 transitions.
[2025-02-06 02:40:14,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:14,700 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:14,700 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:14,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 02:40:14,700 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:14,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:14,701 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008721342, now seen corresponding path program 1 times
[2025-02-06 02:40:14,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:14,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588922030]
[2025-02-06 02:40:14,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:14,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:14,786 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:14,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:14,880 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:14,880 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:15,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:15,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:15,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588922030]
[2025-02-06 02:40:15,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588922030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:15,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:15,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:40:15,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057420667]
[2025-02-06 02:40:15,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:15,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:40:15,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:15,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:40:15,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:15,805 INFO  L87              Difference]: Start difference. First operand 912 states and 1468 transitions. Second operand  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:16,529 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:16,529 INFO  L93              Difference]: Finished difference Result 3627 states and 5839 transitions.
[2025-02-06 02:40:16,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 02:40:16,530 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452
[2025-02-06 02:40:16,531 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:16,546 INFO  L225             Difference]: With dead ends: 3627
[2025-02-06 02:40:16,546 INFO  L226             Difference]: Without dead ends: 2718
[2025-02-06 02:40:16,550 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-06 02:40:16,553 INFO  L435           NwaCegarLoop]: 859 mSDtfsCounter, 865 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:16,553 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1947 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-06 02:40:16,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2718 states.
[2025-02-06 02:40:16,749 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2713.
[2025-02-06 02:40:16,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2713 states, 2247 states have (on average 1.5336003560302627) internal successors, (3446), 2256 states have internal predecessors, (3446), 453 states have call successors, (453), 12 states have call predecessors, (453), 12 states have return successors, (453), 444 states have call predecessors, (453), 453 states have call successors, (453)
[2025-02-06 02:40:16,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4352 transitions.
[2025-02-06 02:40:16,764 INFO  L78                 Accepts]: Start accepts. Automaton has 2713 states and 4352 transitions. Word has length 452
[2025-02-06 02:40:16,765 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:16,765 INFO  L471      AbstractCegarLoop]: Abstraction has 2713 states and 4352 transitions.
[2025-02-06 02:40:16,765 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:16,765 INFO  L276                IsEmpty]: Start isEmpty. Operand 2713 states and 4352 transitions.
[2025-02-06 02:40:16,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:16,770 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:16,770 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:16,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 02:40:16,770 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:16,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:16,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -1964242621, now seen corresponding path program 1 times
[2025-02-06 02:40:16,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:16,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133514316]
[2025-02-06 02:40:16,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:16,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:16,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:16,824 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:16,824 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:16,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:16,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:16,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:16,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133514316]
[2025-02-06 02:40:16,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133514316] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:16,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:16,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:40:16,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180078347]
[2025-02-06 02:40:16,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:16,935 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:40:16,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:16,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:40:16,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:16,936 INFO  L87              Difference]: Start difference. First operand 2713 states and 4352 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:17,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:17,135 INFO  L93              Difference]: Finished difference Result 7356 states and 11790 transitions.
[2025-02-06 02:40:17,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:40:17,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452
[2025-02-06 02:40:17,137 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:17,210 INFO  L225             Difference]: With dead ends: 7356
[2025-02-06 02:40:17,211 INFO  L226             Difference]: Without dead ends: 4646
[2025-02-06 02:40:17,215 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:17,215 INFO  L435           NwaCegarLoop]: 676 mSDtfsCounter, 479 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:17,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1141 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:40:17,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4646 states.
[2025-02-06 02:40:17,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2850.
[2025-02-06 02:40:17,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2850 states, 2317 states have (on average 1.5226586102719033) internal successors, (3528), 2327 states have internal predecessors, (3528), 517 states have call successors, (517), 15 states have call predecessors, (517), 15 states have return successors, (517), 507 states have call predecessors, (517), 517 states have call successors, (517)
[2025-02-06 02:40:17,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4562 transitions.
[2025-02-06 02:40:17,367 INFO  L78                 Accepts]: Start accepts. Automaton has 2850 states and 4562 transitions. Word has length 452
[2025-02-06 02:40:17,368 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:17,368 INFO  L471      AbstractCegarLoop]: Abstraction has 2850 states and 4562 transitions.
[2025-02-06 02:40:17,368 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:17,368 INFO  L276                IsEmpty]: Start isEmpty. Operand 2850 states and 4562 transitions.
[2025-02-06 02:40:17,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:17,374 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:17,374 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:17,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 02:40:17,374 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:17,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:17,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1950709820, now seen corresponding path program 1 times
[2025-02-06 02:40:17,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:17,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134143780]
[2025-02-06 02:40:17,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:17,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:17,407 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:17,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:17,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:17,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:18,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:18,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:18,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134143780]
[2025-02-06 02:40:18,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134143780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:18,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:18,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:40:18,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337638476]
[2025-02-06 02:40:18,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:18,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:40:18,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:18,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:40:18,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:18,158 INFO  L87              Difference]: Start difference. First operand 2850 states and 4562 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:18,401 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:18,401 INFO  L93              Difference]: Finished difference Result 7415 states and 11901 transitions.
[2025-02-06 02:40:18,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:40:18,402 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452
[2025-02-06 02:40:18,403 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:18,425 INFO  L225             Difference]: With dead ends: 7415
[2025-02-06 02:40:18,425 INFO  L226             Difference]: Without dead ends: 4685
[2025-02-06 02:40:18,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:40:18,434 INFO  L435           NwaCegarLoop]: 654 mSDtfsCounter, 320 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:18,434 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1115 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:40:18,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4685 states.
[2025-02-06 02:40:18,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 4663.
[2025-02-06 02:40:18,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4663 states, 3820 states have (on average 1.5269633507853404) internal successors, (5833), 3836 states have internal predecessors, (5833), 819 states have call successors, (819), 23 states have call predecessors, (819), 23 states have return successors, (819), 803 states have call predecessors, (819), 819 states have call successors, (819)
[2025-02-06 02:40:18,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 7471 transitions.
[2025-02-06 02:40:18,684 INFO  L78                 Accepts]: Start accepts. Automaton has 4663 states and 7471 transitions. Word has length 452
[2025-02-06 02:40:18,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:18,685 INFO  L471      AbstractCegarLoop]: Abstraction has 4663 states and 7471 transitions.
[2025-02-06 02:40:18,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:18,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 4663 states and 7471 transitions.
[2025-02-06 02:40:18,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 453
[2025-02-06 02:40:18,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:18,692 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:18,692 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 02:40:18,692 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:18,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:18,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -754261406, now seen corresponding path program 1 times
[2025-02-06 02:40:18,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:18,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285242946]
[2025-02-06 02:40:18,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:18,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:18,724 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes.
[2025-02-06 02:40:18,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements.
[2025-02-06 02:40:18,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:18,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:19,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:19,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:19,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285242946]
[2025-02-06 02:40:19,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285242946] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:19,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:19,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 02:40:19,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737268527]
[2025-02-06 02:40:19,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:19,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 02:40:19,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:19,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 02:40:19,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-06 02:40:19,678 INFO  L87              Difference]: Start difference. First operand 4663 states and 7471 transitions. Second operand  has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:40:20,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:20,936 INFO  L93              Difference]: Finished difference Result 13899 states and 22413 transitions.
[2025-02-06 02:40:20,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 02:40:20,937 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 452
[2025-02-06 02:40:20,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:20,979 INFO  L225             Difference]: With dead ends: 13899
[2025-02-06 02:40:20,979 INFO  L226             Difference]: Without dead ends: 9356
[2025-02-06 02:40:20,996 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-02-06 02:40:20,997 INFO  L435           NwaCegarLoop]: 1117 mSDtfsCounter, 1679 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:20,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 2486 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-06 02:40:21,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9356 states.
[2025-02-06 02:40:21,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9356 to 7080.
[2025-02-06 02:40:21,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7080 states, 5782 states have (on average 1.5226565202352127) internal successors, (8804), 5803 states have internal predecessors, (8804), 1264 states have call successors, (1264), 33 states have call predecessors, (1264), 33 states have return successors, (1264), 1243 states have call predecessors, (1264), 1264 states have call successors, (1264)
[2025-02-06 02:40:21,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 11332 transitions.
[2025-02-06 02:40:21,568 INFO  L78                 Accepts]: Start accepts. Automaton has 7080 states and 11332 transitions. Word has length 452
[2025-02-06 02:40:21,570 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:21,570 INFO  L471      AbstractCegarLoop]: Abstraction has 7080 states and 11332 transitions.
[2025-02-06 02:40:21,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:40:21,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 7080 states and 11332 transitions.
[2025-02-06 02:40:21,579 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:21,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:21,580 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:21,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 02:40:21,580 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:21,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:21,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 307908978, now seen corresponding path program 1 times
[2025-02-06 02:40:21,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:21,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614640331]
[2025-02-06 02:40:21,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:21,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:21,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:21,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:21,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:21,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:22,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:22,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:22,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614640331]
[2025-02-06 02:40:22,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614640331] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:22,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:22,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:40:22,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279292356]
[2025-02-06 02:40:22,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:22,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:40:22,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:22,401 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:40:22,401 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:22,402 INFO  L87              Difference]: Start difference. First operand 7080 states and 11332 transitions. Second operand  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:23,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:23,034 INFO  L93              Difference]: Finished difference Result 10643 states and 17030 transitions.
[2025-02-06 02:40:23,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 02:40:23,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:23,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:23,082 INFO  L225             Difference]: With dead ends: 10643
[2025-02-06 02:40:23,082 INFO  L226             Difference]: Without dead ends: 7913
[2025-02-06 02:40:23,094 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-06 02:40:23,095 INFO  L435           NwaCegarLoop]: 844 mSDtfsCounter, 723 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:23,095 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2019 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 02:40:23,105 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7913 states.
[2025-02-06 02:40:23,367 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7341.
[2025-02-06 02:40:23,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7341 states, 6043 states have (on average 1.527056097964587) internal successors, (9228), 6064 states have internal predecessors, (9228), 1264 states have call successors, (1264), 33 states have call predecessors, (1264), 33 states have return successors, (1264), 1243 states have call predecessors, (1264), 1264 states have call successors, (1264)
[2025-02-06 02:40:23,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 11756 transitions.
[2025-02-06 02:40:23,420 INFO  L78                 Accepts]: Start accepts. Automaton has 7341 states and 11756 transitions. Word has length 453
[2025-02-06 02:40:23,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:23,421 INFO  L471      AbstractCegarLoop]: Abstraction has 7341 states and 11756 transitions.
[2025-02-06 02:40:23,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:23,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 7341 states and 11756 transitions.
[2025-02-06 02:40:23,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:23,427 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:23,428 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:23,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 02:40:23,428 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:23,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:23,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380076283, now seen corresponding path program 1 times
[2025-02-06 02:40:23,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:23,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905835725]
[2025-02-06 02:40:23,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:23,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:23,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:23,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:23,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:23,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:24,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:24,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:24,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905835725]
[2025-02-06 02:40:24,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905835725] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:24,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:24,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:40:24,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899278881]
[2025-02-06 02:40:24,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:24,747 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:40:24,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:24,747 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:40:24,747 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:24,748 INFO  L87              Difference]: Start difference. First operand 7341 states and 11756 transitions. Second operand  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:25,434 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:25,434 INFO  L93              Difference]: Finished difference Result 21787 states and 34909 transitions.
[2025-02-06 02:40:25,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 02:40:25,435 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:25,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:25,487 INFO  L225             Difference]: With dead ends: 21787
[2025-02-06 02:40:25,487 INFO  L226             Difference]: Without dead ends: 14566
[2025-02-06 02:40:25,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:25,511 INFO  L435           NwaCegarLoop]: 871 mSDtfsCounter, 848 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:25,511 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1646 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 02:40:25,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14566 states.
[2025-02-06 02:40:26,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14566 to 8369.
[2025-02-06 02:40:26,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8369 states, 7070 states have (on average 1.5444130127298443) internal successors, (10919), 7091 states have internal predecessors, (10919), 1264 states have call successors, (1264), 34 states have call predecessors, (1264), 34 states have return successors, (1264), 1243 states have call predecessors, (1264), 1264 states have call successors, (1264)
[2025-02-06 02:40:26,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 13447 transitions.
[2025-02-06 02:40:26,343 INFO  L78                 Accepts]: Start accepts. Automaton has 8369 states and 13447 transitions. Word has length 453
[2025-02-06 02:40:26,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:26,345 INFO  L471      AbstractCegarLoop]: Abstraction has 8369 states and 13447 transitions.
[2025-02-06 02:40:26,345 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:26,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 8369 states and 13447 transitions.
[2025-02-06 02:40:26,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:26,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:26,354 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:26,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-06 02:40:26,354 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:26,354 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:26,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1133763196, now seen corresponding path program 1 times
[2025-02-06 02:40:26,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:26,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799859081]
[2025-02-06 02:40:26,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:26,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:26,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:26,989 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:26,989 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:26,989 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:27,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:27,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:27,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799859081]
[2025-02-06 02:40:27,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799859081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:27,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:27,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:40:27,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061219647]
[2025-02-06 02:40:27,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:27,484 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:40:27,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:27,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:40:27,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:27,485 INFO  L87              Difference]: Start difference. First operand 8369 states and 13447 transitions. Second operand  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:28,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:28,095 INFO  L93              Difference]: Finished difference Result 19456 states and 31237 transitions.
[2025-02-06 02:40:28,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:40:28,096 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:28,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:28,136 INFO  L225             Difference]: With dead ends: 19456
[2025-02-06 02:40:28,136 INFO  L226             Difference]: Without dead ends: 11211
[2025-02-06 02:40:28,160 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:28,162 INFO  L435           NwaCegarLoop]: 827 mSDtfsCounter, 854 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:28,162 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1299 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 02:40:28,172 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11211 states.
[2025-02-06 02:40:28,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 11113.
[2025-02-06 02:40:28,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11113 states, 9354 states have (on average 1.525978191148172) internal successors, (14274), 9385 states have internal predecessors, (14274), 1709 states have call successors, (1709), 49 states have call predecessors, (1709), 49 states have return successors, (1709), 1678 states have call predecessors, (1709), 1709 states have call successors, (1709)
[2025-02-06 02:40:28,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 17692 transitions.
[2025-02-06 02:40:28,701 INFO  L78                 Accepts]: Start accepts. Automaton has 11113 states and 17692 transitions. Word has length 453
[2025-02-06 02:40:28,702 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:28,702 INFO  L471      AbstractCegarLoop]: Abstraction has 11113 states and 17692 transitions.
[2025-02-06 02:40:28,702 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:28,702 INFO  L276                IsEmpty]: Start isEmpty. Operand 11113 states and 17692 transitions.
[2025-02-06 02:40:28,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:28,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:28,710 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:28,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-06 02:40:28,711 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:28,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:28,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -166001500, now seen corresponding path program 1 times
[2025-02-06 02:40:28,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:28,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436862350]
[2025-02-06 02:40:28,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:28,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:28,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:28,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:28,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:28,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:29,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:29,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:29,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436862350]
[2025-02-06 02:40:29,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436862350] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:29,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:29,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:40:29,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974711462]
[2025-02-06 02:40:29,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:29,326 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:40:29,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:29,327 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:40:29,327 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:29,327 INFO  L87              Difference]: Start difference. First operand 11113 states and 17692 transitions. Second operand  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:30,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:30,442 INFO  L93              Difference]: Finished difference Result 37402 states and 59147 transitions.
[2025-02-06 02:40:30,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:40:30,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:30,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:30,531 INFO  L225             Difference]: With dead ends: 37402
[2025-02-06 02:40:30,531 INFO  L226             Difference]: Without dead ends: 26413
[2025-02-06 02:40:30,561 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:30,562 INFO  L435           NwaCegarLoop]: 630 mSDtfsCounter, 583 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:30,562 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1441 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-06 02:40:30,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26413 states.
[2025-02-06 02:40:31,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26413 to 21284.
[2025-02-06 02:40:31,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21284 states, 18209 states have (on average 1.53171508594651) internal successors, (27891), 18280 states have internal predecessors, (27891), 2979 states have call successors, (2979), 95 states have call predecessors, (2979), 95 states have return successors, (2979), 2908 states have call predecessors, (2979), 2979 states have call successors, (2979)
[2025-02-06 02:40:31,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21284 states to 21284 states and 33849 transitions.
[2025-02-06 02:40:31,881 INFO  L78                 Accepts]: Start accepts. Automaton has 21284 states and 33849 transitions. Word has length 453
[2025-02-06 02:40:31,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:31,882 INFO  L471      AbstractCegarLoop]: Abstraction has 21284 states and 33849 transitions.
[2025-02-06 02:40:31,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:31,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 21284 states and 33849 transitions.
[2025-02-06 02:40:31,900 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:31,901 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:31,901 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:31,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-06 02:40:31,902 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:31,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:31,903 INFO  L85        PathProgramCache]: Analyzing trace with hash -1190695421, now seen corresponding path program 1 times
[2025-02-06 02:40:31,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:31,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158502106]
[2025-02-06 02:40:31,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:31,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:31,937 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:32,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:32,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:32,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:32,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:32,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:32,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158502106]
[2025-02-06 02:40:32,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158502106] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:32,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:32,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:40:32,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878499452]
[2025-02-06 02:40:32,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:32,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:40:32,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:32,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:40:32,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:32,644 INFO  L87              Difference]: Start difference. First operand 21284 states and 33849 transitions. Second operand  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:34,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:34,359 INFO  L93              Difference]: Finished difference Result 53485 states and 84586 transitions.
[2025-02-06 02:40:34,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 02:40:34,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:34,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:34,461 INFO  L225             Difference]: With dead ends: 53485
[2025-02-06 02:40:34,461 INFO  L226             Difference]: Without dead ends: 32329
[2025-02-06 02:40:34,486 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-02-06 02:40:34,487 INFO  L435           NwaCegarLoop]: 1057 mSDtfsCounter, 1163 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:34,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 3480 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-06 02:40:34,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32329 states.
[2025-02-06 02:40:35,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32329 to 21376.
[2025-02-06 02:40:35,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21376 states, 18252 states have (on average 1.5133136094674555) internal successors, (27621), 18303 states have internal predecessors, (27621), 2974 states have call successors, (2974), 149 states have call predecessors, (2974), 149 states have return successors, (2974), 2923 states have call predecessors, (2974), 2974 states have call successors, (2974)
[2025-02-06 02:40:35,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21376 states to 21376 states and 33569 transitions.
[2025-02-06 02:40:35,839 INFO  L78                 Accepts]: Start accepts. Automaton has 21376 states and 33569 transitions. Word has length 453
[2025-02-06 02:40:35,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:35,839 INFO  L471      AbstractCegarLoop]: Abstraction has 21376 states and 33569 transitions.
[2025-02-06 02:40:35,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:35,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 21376 states and 33569 transitions.
[2025-02-06 02:40:35,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:35,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:35,854 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:35,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-06 02:40:35,854 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:35,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:35,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 1403531396, now seen corresponding path program 1 times
[2025-02-06 02:40:35,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:35,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172909672]
[2025-02-06 02:40:35,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:35,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:35,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:36,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:36,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:36,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:36,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:36,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:36,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172909672]
[2025-02-06 02:40:36,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172909672] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:36,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:36,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:40:36,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433159219]
[2025-02-06 02:40:36,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:36,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:40:36,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:36,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:40:36,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:36,454 INFO  L87              Difference]: Start difference. First operand 21376 states and 33569 transitions. Second operand  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:38,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:38,194 INFO  L93              Difference]: Finished difference Result 67878 states and 106654 transitions.
[2025-02-06 02:40:38,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:40:38,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:38,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:38,341 INFO  L225             Difference]: With dead ends: 67878
[2025-02-06 02:40:38,341 INFO  L226             Difference]: Without dead ends: 46587
[2025-02-06 02:40:38,374 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:38,374 INFO  L435           NwaCegarLoop]: 602 mSDtfsCounter, 558 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:38,375 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1440 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-06 02:40:38,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46587 states.
[2025-02-06 02:40:40,280 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46587 to 41219.
[2025-02-06 02:40:40,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41219 states, 36959 states have (on average 1.5470656673611298) internal successors, (57178), 37040 states have internal predecessors, (57178), 4034 states have call successors, (4034), 225 states have call predecessors, (4034), 225 states have return successors, (4034), 3953 states have call predecessors, (4034), 4034 states have call successors, (4034)
[2025-02-06 02:40:40,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41219 states to 41219 states and 65246 transitions.
[2025-02-06 02:40:40,396 INFO  L78                 Accepts]: Start accepts. Automaton has 41219 states and 65246 transitions. Word has length 453
[2025-02-06 02:40:40,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:40,397 INFO  L471      AbstractCegarLoop]: Abstraction has 41219 states and 65246 transitions.
[2025-02-06 02:40:40,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:40,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 41219 states and 65246 transitions.
[2025-02-06 02:40:40,418 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 454
[2025-02-06 02:40:40,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:40,418 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:40,418 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-06 02:40:40,419 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:40,419 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:40,419 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136940957, now seen corresponding path program 1 times
[2025-02-06 02:40:40,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:40,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100053543]
[2025-02-06 02:40:40,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:40,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:40,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes.
[2025-02-06 02:40:40,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements.
[2025-02-06 02:40:40,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:40,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:41,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:41,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:41,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100053543]
[2025-02-06 02:40:41,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100053543] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:41,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:41,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:40:41,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930111682]
[2025-02-06 02:40:41,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:41,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:40:41,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:41,229 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:40:41,229 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:41,229 INFO  L87              Difference]: Start difference. First operand 41219 states and 65246 transitions. Second operand  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:42,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:42,950 INFO  L93              Difference]: Finished difference Result 86039 states and 136175 transitions.
[2025-02-06 02:40:42,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 02:40:42,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453
[2025-02-06 02:40:42,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:43,059 INFO  L225             Difference]: With dead ends: 86039
[2025-02-06 02:40:43,059 INFO  L226             Difference]: Without dead ends: 44909
[2025-02-06 02:40:43,117 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:40:43,118 INFO  L435           NwaCegarLoop]: 1287 mSDtfsCounter, 1171 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 3563 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:43,119 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 3563 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-06 02:40:43,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44909 states.
[2025-02-06 02:40:44,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44909 to 40389.
[2025-02-06 02:40:44,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40389 states, 36823 states have (on average 1.557124623197458) internal successors, (57338), 36884 states have internal predecessors, (57338), 3368 states have call successors, (3368), 197 states have call predecessors, (3368), 197 states have return successors, (3368), 3307 states have call predecessors, (3368), 3368 states have call successors, (3368)
[2025-02-06 02:40:45,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40389 states to 40389 states and 64074 transitions.
[2025-02-06 02:40:45,031 INFO  L78                 Accepts]: Start accepts. Automaton has 40389 states and 64074 transitions. Word has length 453
[2025-02-06 02:40:45,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:45,032 INFO  L471      AbstractCegarLoop]: Abstraction has 40389 states and 64074 transitions.
[2025-02-06 02:40:45,032 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:45,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 40389 states and 64074 transitions.
[2025-02-06 02:40:45,055 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 455
[2025-02-06 02:40:45,055 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:45,055 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:45,056 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-06 02:40:45,056 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:45,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:45,056 INFO  L85        PathProgramCache]: Analyzing trace with hash -337814892, now seen corresponding path program 1 times
[2025-02-06 02:40:45,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:45,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323042599]
[2025-02-06 02:40:45,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:45,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:45,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes.
[2025-02-06 02:40:45,235 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements.
[2025-02-06 02:40:45,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:45,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:45,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:45,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:45,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323042599]
[2025-02-06 02:40:45,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323042599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:45,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:45,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 02:40:45,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800393480]
[2025-02-06 02:40:45,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:45,987 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 02:40:45,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:45,987 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 02:40:45,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-06 02:40:45,989 INFO  L87              Difference]: Start difference. First operand 40389 states and 64074 transitions. Second operand  has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:48,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:48,420 INFO  L93              Difference]: Finished difference Result 113018 states and 178722 transitions.
[2025-02-06 02:40:48,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-06 02:40:48,420 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454
[2025-02-06 02:40:48,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:48,587 INFO  L225             Difference]: With dead ends: 113018
[2025-02-06 02:40:48,588 INFO  L226             Difference]: Without dead ends: 92523
[2025-02-06 02:40:48,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-06 02:40:48,626 INFO  L435           NwaCegarLoop]: 550 mSDtfsCounter, 872 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:48,626 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3038 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-06 02:40:48,673 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92523 states.
[2025-02-06 02:40:50,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92523 to 74698.
[2025-02-06 02:40:50,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 74698 states, 70988 states have (on average 1.5762241505606582) internal successors, (111893), 71097 states have internal predecessors, (111893), 3464 states have call successors, (3464), 245 states have call predecessors, (3464), 245 states have return successors, (3464), 3355 states have call predecessors, (3464), 3464 states have call successors, (3464)
[2025-02-06 02:40:50,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74698 states to 74698 states and 118821 transitions.
[2025-02-06 02:40:50,588 INFO  L78                 Accepts]: Start accepts. Automaton has 74698 states and 118821 transitions. Word has length 454
[2025-02-06 02:40:50,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:50,589 INFO  L471      AbstractCegarLoop]: Abstraction has 74698 states and 118821 transitions.
[2025-02-06 02:40:50,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:50,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 74698 states and 118821 transitions.
[2025-02-06 02:40:50,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 455
[2025-02-06 02:40:50,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:50,639 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:50,639 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-06 02:40:50,639 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:50,640 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:50,640 INFO  L85        PathProgramCache]: Analyzing trace with hash -945891755, now seen corresponding path program 1 times
[2025-02-06 02:40:50,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:50,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372139574]
[2025-02-06 02:40:50,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:50,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:50,681 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes.
[2025-02-06 02:40:51,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements.
[2025-02-06 02:40:51,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:51,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:51,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:51,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:51,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372139574]
[2025-02-06 02:40:51,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372139574] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:51,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:51,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:40:51,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823461937]
[2025-02-06 02:40:51,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:51,375 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:40:51,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:51,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:40:51,376 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:51,376 INFO  L87              Difference]: Start difference. First operand 74698 states and 118821 transitions. Second operand  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:52,922 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:40:52,923 INFO  L93              Difference]: Finished difference Result 116166 states and 184954 transitions.
[2025-02-06 02:40:52,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:40:52,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454
[2025-02-06 02:40:52,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:40:53,033 INFO  L225             Difference]: With dead ends: 116166
[2025-02-06 02:40:53,033 INFO  L226             Difference]: Without dead ends: 61240
[2025-02-06 02:40:53,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:40:53,091 INFO  L435           NwaCegarLoop]: 649 mSDtfsCounter, 909 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-06 02:40:53,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1383 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-06 02:40:53,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61240 states.
[2025-02-06 02:40:54,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61240 to 59162.
[2025-02-06 02:40:54,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59162 states, 56563 states have (on average 1.5778512455138518) internal successors, (89248), 56624 states have internal predecessors, (89248), 2415 states have call successors, (2415), 183 states have call predecessors, (2415), 183 states have return successors, (2415), 2354 states have call predecessors, (2415), 2415 states have call successors, (2415)
[2025-02-06 02:40:54,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59162 states to 59162 states and 94078 transitions.
[2025-02-06 02:40:54,969 INFO  L78                 Accepts]: Start accepts. Automaton has 59162 states and 94078 transitions. Word has length 454
[2025-02-06 02:40:54,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:40:54,970 INFO  L471      AbstractCegarLoop]: Abstraction has 59162 states and 94078 transitions.
[2025-02-06 02:40:54,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)
[2025-02-06 02:40:54,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 59162 states and 94078 transitions.
[2025-02-06 02:40:54,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 455
[2025-02-06 02:40:54,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:40:54,999 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:40:54,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-06 02:40:54,999 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:40:55,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:40:55,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 669682955, now seen corresponding path program 1 times
[2025-02-06 02:40:55,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:40:55,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138659660]
[2025-02-06 02:40:55,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:40:55,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:40:55,029 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes.
[2025-02-06 02:40:55,309 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements.
[2025-02-06 02:40:55,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:40:55,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:40:56,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked.
[2025-02-06 02:40:56,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:40:56,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138659660]
[2025-02-06 02:40:56,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138659660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:40:56,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:40:56,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-02-06 02:40:56,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454095851]
[2025-02-06 02:40:56,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:40:56,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-06 02:40:56,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:40:56,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-06 02:40:56,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-02-06 02:40:56,110 INFO  L87              Difference]: Start difference. First operand 59162 states and 94078 transitions. Second operand  has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:41:01,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:41:01,520 INFO  L93              Difference]: Finished difference Result 190243 states and 301576 transitions.
[2025-02-06 02:41:01,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-02-06 02:41:01,520 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 454
[2025-02-06 02:41:01,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:41:01,734 INFO  L225             Difference]: With dead ends: 190243
[2025-02-06 02:41:01,734 INFO  L226             Difference]: Without dead ends: 131139
[2025-02-06 02:41:01,813 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600
[2025-02-06 02:41:01,814 INFO  L435           NwaCegarLoop]: 1103 mSDtfsCounter, 3679 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3679 SdHoareTripleChecker+Valid, 6122 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-06 02:41:01,814 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3679 Valid, 6122 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-06 02:41:01,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131139 states.
[2025-02-06 02:41:03,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131139 to 68676.
[2025-02-06 02:41:03,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68676 states, 65537 states have (on average 1.5737827486763203) internal successors, (103141), 65618 states have internal predecessors, (103141), 2915 states have call successors, (2915), 223 states have call predecessors, (2915), 223 states have return successors, (2915), 2834 states have call predecessors, (2915), 2915 states have call successors, (2915)
[2025-02-06 02:41:03,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68676 states to 68676 states and 108971 transitions.
[2025-02-06 02:41:03,850 INFO  L78                 Accepts]: Start accepts. Automaton has 68676 states and 108971 transitions. Word has length 454
[2025-02-06 02:41:03,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:41:03,851 INFO  L471      AbstractCegarLoop]: Abstraction has 68676 states and 108971 transitions.
[2025-02-06 02:41:03,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64)
[2025-02-06 02:41:03,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 68676 states and 108971 transitions.
[2025-02-06 02:41:03,885 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 455
[2025-02-06 02:41:03,885 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:41:03,885 INFO  L218           NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 02:41:03,885 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-06 02:41:03,885 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:41:03,886 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:41:03,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 950032844, now seen corresponding path program 1 times
[2025-02-06 02:41:03,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:41:03,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332365068]
[2025-02-06 02:41:03,886 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:41:03,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:41:03,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes.
[2025-02-06 02:41:04,075 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements.
[2025-02-06 02:41:04,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:41:04,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat