./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.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-61.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 bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 02:42:25,875 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 02:42:25,921 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:42:25,925 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 02:42:25,929 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 02:42:25,949 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 02:42:25,950 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 02:42:25,950 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 02:42:25,950 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 02:42:25,950 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 02:42:25,951 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 02:42:25,951 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 02:42:25,951 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 02:42:25,952 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 02:42:25,952 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 02:42:25,953 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 02:42:25,953 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 02:42:25,954 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 02:42:25,954 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 02:42:25,955 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 02:42:25,955 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 02:42:25,955 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 02:42:25,955 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 -> bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16
[2025-02-06 02:42:26,167 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 02:42:26,172 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 02:42:26,175 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 02:42:26,176 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 02:42:26,177 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 02:42:26,178 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-61.i
[2025-02-06 02:42:27,299 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe64f7d92/08d1aa2a45bf4257a1997447439fa481/FLAG491fd4663
[2025-02-06 02:42:27,673 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 02:42:27,677 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i
[2025-02-06 02:42:27,694 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe64f7d92/08d1aa2a45bf4257a1997447439fa481/FLAG491fd4663
[2025-02-06 02:42:27,885 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe64f7d92/08d1aa2a45bf4257a1997447439fa481
[2025-02-06 02:42:27,887 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 02:42:27,888 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 02:42:27,889 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 02:42:27,890 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 02:42:27,892 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 02:42:27,894 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:27" (1/1) ...
[2025-02-06 02:42:27,895 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:27, skipping insertion in model container
[2025-02-06 02:42:27,895 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:27" (1/1) ...
[2025-02-06 02:42:27,930 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 02:42:28,038 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-61.i[916,929]
[2025-02-06 02:42:28,176 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 02:42:28,194 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 02:42:28,201 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-61.i[916,929]
[2025-02-06 02:42:28,272 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 02:42:28,288 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 02:42:28,288 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28 WrapperNode
[2025-02-06 02:42:28,289 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 02:42:28,290 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 02:42:28,290 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 02:42:28,290 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 02:42:28,294 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:42:28" (1/1) ...
[2025-02-06 02:42:28,309 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:42:28" (1/1) ...
[2025-02-06 02:42:28,368 INFO  L138                Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 721
[2025-02-06 02:42:28,369 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 02:42:28,369 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 02:42:28,370 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 02:42:28,370 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 02:42:28,376 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,377 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,384 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,443 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:42:28,443 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,443 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,464 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,470 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,475 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,478 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,488 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 02:42:28,489 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 02:42:28,489 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 02:42:28,489 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 02:42:28,489 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (1/1) ...
[2025-02-06 02:42:28,493 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 02:42:28,501 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 02:42:28,513 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:42:28,518 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:42:28,532 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 02:42:28,532 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-06 02:42:28,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-06 02:42:28,532 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 02:42:28,532 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 02:42:28,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 02:42:28,637 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 02:42:28,638 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 02:42:29,429 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short59#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise60#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1;
[2025-02-06 02:42:29,542 INFO  L?                        ?]: Removed 85 outVars from TransFormulas that were not future-live.
[2025-02-06 02:42:29,542 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 02:42:29,580 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 02:42:29,582 INFO  L337             CfgBuilder]: Removed 2 assume(true) statements.
[2025-02-06 02:42:29,583 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:29 BoogieIcfgContainer
[2025-02-06 02:42:29,583 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 02:42:29,585 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 02:42:29,585 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 02:42:29,588 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 02:42:29,588 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:42:27" (1/3) ...
[2025-02-06 02:42:29,588 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e566655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:29, skipping insertion in model container
[2025-02-06 02:42:29,589 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:28" (2/3) ...
[2025-02-06 02:42:29,589 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e566655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:29, skipping insertion in model container
[2025-02-06 02:42:29,590 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:29" (3/3) ...
[2025-02-06 02:42:29,591 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-61.i
[2025-02-06 02:42:29,600 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 02:42:29,603 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-61.i that has 2 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-06 02:42:29,650 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 02:42:29,660 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;@75fd62d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 02:42:29,661 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-06 02:42:29,664 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 288 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 220 states have internal predecessors, (341), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 02:42:29,682 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-02-06 02:42:29,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:29,684 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:29,684 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:29,688 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:29,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 1969490427, now seen corresponding path program 1 times
[2025-02-06 02:42:29,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:29,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217206037]
[2025-02-06 02:42:29,694 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:29,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:29,788 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-02-06 02:42:29,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-02-06 02:42:29,827 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:29,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:30,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked.
[2025-02-06 02:42:30,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:30,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217206037]
[2025-02-06 02:42:30,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217206037] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 02:42:30,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258251127]
[2025-02-06 02:42:30,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:30,177 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 02:42:30,177 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 02:42:30,179 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:42:30,180 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:42:30,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-02-06 02:42:30,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-02-06 02:42:30,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:30,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:30,466 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-06 02:42:30,482 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 02:42:30,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked.
[2025-02-06 02:42:30,543 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-06 02:42:30,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258251127] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:30,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-06 02:42:30,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-06 02:42:30,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531940961]
[2025-02-06 02:42:30,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:30,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-06 02:42:30,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:30,567 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 02:42:30,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 02:42:30,570 INFO  L87              Difference]: Start difference. First operand  has 288 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 220 states have internal predecessors, (341), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand  has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:30,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:30,642 INFO  L93              Difference]: Finished difference Result 570 states and 1007 transitions.
[2025-02-06 02:42:30,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 02:42:30,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 459
[2025-02-06 02:42:30,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:30,653 INFO  L225             Difference]: With dead ends: 570
[2025-02-06 02:42:30,653 INFO  L226             Difference]: Without dead ends: 285
[2025-02-06 02:42:30,657 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 460 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:42:30,659 INFO  L435           NwaCegarLoop]: 458 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:30,660 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 02:42:30,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2025-02-06 02:42:30,712 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285.
[2025-02-06 02:42:30,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 285 states, 217 states have (on average 1.5483870967741935) internal successors, (336), 217 states have internal predecessors, (336), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 02:42:30,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 468 transitions.
[2025-02-06 02:42:30,725 INFO  L78                 Accepts]: Start accepts. Automaton has 285 states and 468 transitions. Word has length 459
[2025-02-06 02:42:30,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:30,726 INFO  L471      AbstractCegarLoop]: Abstraction has 285 states and 468 transitions.
[2025-02-06 02:42:30,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:30,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 285 states and 468 transitions.
[2025-02-06 02:42:30,738 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-02-06 02:42:30,738 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:30,739 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:30,747 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-06 02:42:30,943 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:42:30,943 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:30,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:30,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107885251, now seen corresponding path program 1 times
[2025-02-06 02:42:30,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:30,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583791481]
[2025-02-06 02:42:30,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:30,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:30,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-02-06 02:42:31,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-02-06 02:42:31,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:31,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:31,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:31,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:31,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583791481]
[2025-02-06 02:42:31,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583791481] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:31,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:31,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:42:31,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851786714]
[2025-02-06 02:42:31,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:31,461 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:42:31,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:31,463 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:42:31,463 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:42:31,464 INFO  L87              Difference]: Start difference. First operand 285 states and 468 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:31,571 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:31,571 INFO  L93              Difference]: Finished difference Result 837 states and 1378 transitions.
[2025-02-06 02:42:31,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:42:31,572 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459
[2025-02-06 02:42:31,573 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:31,577 INFO  L225             Difference]: With dead ends: 837
[2025-02-06 02:42:31,578 INFO  L226             Difference]: Without dead ends: 555
[2025-02-06 02:42:31,579 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:42:31,580 INFO  L435           NwaCegarLoop]: 451 mSDtfsCounter, 459 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:31,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 876 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:42:31,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 555 states.
[2025-02-06 02:42:31,615 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 394.
[2025-02-06 02:42:31,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 394 states, 326 states have (on average 1.607361963190184) internal successors, (524), 326 states have internal predecessors, (524), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-06 02:42:31,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 656 transitions.
[2025-02-06 02:42:31,622 INFO  L78                 Accepts]: Start accepts. Automaton has 394 states and 656 transitions. Word has length 459
[2025-02-06 02:42:31,623 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:31,623 INFO  L471      AbstractCegarLoop]: Abstraction has 394 states and 656 transitions.
[2025-02-06 02:42:31,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:31,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 394 states and 656 transitions.
[2025-02-06 02:42:31,628 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-02-06 02:42:31,629 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:31,629 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:31,629 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 02:42:31,629 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:31,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:31,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316583554, now seen corresponding path program 1 times
[2025-02-06 02:42:31,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:31,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714898756]
[2025-02-06 02:42:31,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:31,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:31,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-02-06 02:42:31,796 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-02-06 02:42:31,796 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:31,797 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:32,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:32,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:32,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714898756]
[2025-02-06 02:42:32,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714898756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:32,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:32,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:42:32,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062803267]
[2025-02-06 02:42:32,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:32,284 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:42:32,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:32,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:42:32,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:42:32,286 INFO  L87              Difference]: Start difference. First operand 394 states and 656 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:32,530 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:32,531 INFO  L93              Difference]: Finished difference Result 1074 states and 1793 transitions.
[2025-02-06 02:42:32,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:42:32,531 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459
[2025-02-06 02:42:32,532 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:32,538 INFO  L225             Difference]: With dead ends: 1074
[2025-02-06 02:42:32,540 INFO  L226             Difference]: Without dead ends: 683
[2025-02-06 02:42:32,541 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:42:32,542 INFO  L435           NwaCegarLoop]: 417 mSDtfsCounter, 292 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:32,542 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 817 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 02:42:32,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 683 states.
[2025-02-06 02:42:32,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680.
[2025-02-06 02:42:32,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 680 states, 593 states have (on average 1.6323777403035413) internal successors, (968), 594 states have internal predecessors, (968), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84)
[2025-02-06 02:42:32,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1136 transitions.
[2025-02-06 02:42:32,578 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 1136 transitions. Word has length 459
[2025-02-06 02:42:32,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:32,579 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 1136 transitions.
[2025-02-06 02:42:32,579 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:32,579 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 1136 transitions.
[2025-02-06 02:42:32,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 460
[2025-02-06 02:42:32,585 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:32,585 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:32,585 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 02:42:32,585 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:32,586 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:32,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -12189825, now seen corresponding path program 1 times
[2025-02-06 02:42:32,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:32,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954080141]
[2025-02-06 02:42:32,586 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:32,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:32,635 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes.
[2025-02-06 02:42:32,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements.
[2025-02-06 02:42:32,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:32,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:33,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:33,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:33,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954080141]
[2025-02-06 02:42:33,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954080141] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:33,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:33,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:42:33,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360694678]
[2025-02-06 02:42:33,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:33,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:42:33,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:33,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:42:33,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:42:33,090 INFO  L87              Difference]: Start difference. First operand 680 states and 1136 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:33,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:33,170 INFO  L93              Difference]: Finished difference Result 2034 states and 3402 transitions.
[2025-02-06 02:42:33,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:42:33,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459
[2025-02-06 02:42:33,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:33,178 INFO  L225             Difference]: With dead ends: 2034
[2025-02-06 02:42:33,178 INFO  L226             Difference]: Without dead ends: 1357
[2025-02-06 02:42:33,180 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:42:33,180 INFO  L435           NwaCegarLoop]: 617 mSDtfsCounter, 314 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:33,181 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1062 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-06 02:42:33,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1357 states.
[2025-02-06 02:42:33,248 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1355.
[2025-02-06 02:42:33,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1355 states, 1182 states have (on average 1.6311336717428089) internal successors, (1928), 1184 states have internal predecessors, (1928), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168)
[2025-02-06 02:42:33,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2264 transitions.
[2025-02-06 02:42:33,257 INFO  L78                 Accepts]: Start accepts. Automaton has 1355 states and 2264 transitions. Word has length 459
[2025-02-06 02:42:33,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:33,258 INFO  L471      AbstractCegarLoop]: Abstraction has 1355 states and 2264 transitions.
[2025-02-06 02:42:33,258 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:33,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 1355 states and 2264 transitions.
[2025-02-06 02:42:33,263 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:33,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:33,264 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:33,264 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 02:42:33,264 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:33,265 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:33,265 INFO  L85        PathProgramCache]: Analyzing trace with hash -387579318, now seen corresponding path program 1 times
[2025-02-06 02:42:33,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:33,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277649184]
[2025-02-06 02:42:33,265 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:33,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:33,309 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:33,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:33,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:33,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:33,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:33,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:33,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277649184]
[2025-02-06 02:42:33,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277649184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:33,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:33,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-06 02:42:33,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954585165]
[2025-02-06 02:42:33,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:33,966 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 02:42:33,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:33,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 02:42:33,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 02:42:33,967 INFO  L87              Difference]: Start difference. First operand 1355 states and 2264 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:34,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:34,107 INFO  L93              Difference]: Finished difference Result 4059 states and 6786 transitions.
[2025-02-06 02:42:34,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 02:42:34,108 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460
[2025-02-06 02:42:34,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:34,122 INFO  L225             Difference]: With dead ends: 4059
[2025-02-06 02:42:34,123 INFO  L226             Difference]: Without dead ends: 2707
[2025-02-06 02:42:34,127 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:42:34,127 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 345 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:34,128 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 893 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:42:34,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2707 states.
[2025-02-06 02:42:34,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2705.
[2025-02-06 02:42:34,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2705 states, 2360 states have (on average 1.6271186440677967) internal successors, (3840), 2364 states have internal predecessors, (3840), 336 states have call successors, (336), 8 states have call predecessors, (336), 8 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336)
[2025-02-06 02:42:34,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 4512 transitions.
[2025-02-06 02:42:34,262 INFO  L78                 Accepts]: Start accepts. Automaton has 2705 states and 4512 transitions. Word has length 460
[2025-02-06 02:42:34,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:34,263 INFO  L471      AbstractCegarLoop]: Abstraction has 2705 states and 4512 transitions.
[2025-02-06 02:42:34,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:34,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 2705 states and 4512 transitions.
[2025-02-06 02:42:34,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:34,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:34,271 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:34,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 02:42:34,271 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:34,272 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:34,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -374046517, now seen corresponding path program 1 times
[2025-02-06 02:42:34,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:34,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349229033]
[2025-02-06 02:42:34,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:34,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:34,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:34,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:34,649 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:34,649 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:35,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:35,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:35,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349229033]
[2025-02-06 02:42:35,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349229033] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:35,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:35,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 02:42:35,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875304220]
[2025-02-06 02:42:35,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:35,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 02:42:35,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:35,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 02:42:35,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-06 02:42:35,784 INFO  L87              Difference]: Start difference. First operand 2705 states and 4512 transitions. Second operand  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:36,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:36,100 INFO  L93              Difference]: Finished difference Result 6643 states and 10859 transitions.
[2025-02-06 02:42:36,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 02:42:36,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460
[2025-02-06 02:42:36,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:36,119 INFO  L225             Difference]: With dead ends: 6643
[2025-02-06 02:42:36,119 INFO  L226             Difference]: Without dead ends: 3941
[2025-02-06 02:42:36,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-06 02:42:36,127 INFO  L435           NwaCegarLoop]: 438 mSDtfsCounter, 817 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:36,128 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1373 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 02:42:36,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3941 states.
[2025-02-06 02:42:36,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 2737.
[2025-02-06 02:42:36,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2737 states, 2384 states have (on average 1.6140939597315436) internal successors, (3848), 2388 states have internal predecessors, (3848), 336 states have call successors, (336), 16 states have call predecessors, (336), 16 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336)
[2025-02-06 02:42:36,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4520 transitions.
[2025-02-06 02:42:36,262 INFO  L78                 Accepts]: Start accepts. Automaton has 2737 states and 4520 transitions. Word has length 460
[2025-02-06 02:42:36,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:36,262 INFO  L471      AbstractCegarLoop]: Abstraction has 2737 states and 4520 transitions.
[2025-02-06 02:42:36,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:36,263 INFO  L276                IsEmpty]: Start isEmpty. Operand 2737 states and 4520 transitions.
[2025-02-06 02:42:36,267 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:36,267 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:36,267 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:36,268 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 02:42:36,268 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:36,268 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:36,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 651445482, now seen corresponding path program 1 times
[2025-02-06 02:42:36,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:36,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73839625]
[2025-02-06 02:42:36,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:36,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:36,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:36,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:36,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:36,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:36,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:36,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:36,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73839625]
[2025-02-06 02:42:36,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73839625] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:36,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:36,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 02:42:36,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983884761]
[2025-02-06 02:42:36,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:36,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 02:42:36,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:36,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 02:42:36,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 02:42:36,806 INFO  L87              Difference]: Start difference. First operand 2737 states and 4520 transitions. Second operand  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:37,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:37,771 INFO  L93              Difference]: Finished difference Result 12513 states and 20676 transitions.
[2025-02-06 02:42:37,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-06 02:42:37,772 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460
[2025-02-06 02:42:37,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:37,808 INFO  L225             Difference]: With dead ends: 12513
[2025-02-06 02:42:37,808 INFO  L226             Difference]: Without dead ends: 9779
[2025-02-06 02:42:37,814 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2025-02-06 02:42:37,815 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 2201 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:37,815 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 1454 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-06 02:42:37,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9779 states.
[2025-02-06 02:42:38,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 3337.
[2025-02-06 02:42:38,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3337 states, 2976 states have (on average 1.6155913978494623) internal successors, (4808), 2980 states have internal predecessors, (4808), 336 states have call successors, (336), 24 states have call predecessors, (336), 24 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336)
[2025-02-06 02:42:38,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5480 transitions.
[2025-02-06 02:42:38,097 INFO  L78                 Accepts]: Start accepts. Automaton has 3337 states and 5480 transitions. Word has length 460
[2025-02-06 02:42:38,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:38,097 INFO  L471      AbstractCegarLoop]: Abstraction has 3337 states and 5480 transitions.
[2025-02-06 02:42:38,098 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:38,098 INFO  L276                IsEmpty]: Start isEmpty. Operand 3337 states and 5480 transitions.
[2025-02-06 02:42:38,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:38,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:38,105 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 02:42:38,105 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:38,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:38,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621026505, now seen corresponding path program 1 times
[2025-02-06 02:42:38,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:38,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930431209]
[2025-02-06 02:42:38,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:38,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:38,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:38,548 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:38,548 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:38,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:38,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:38,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:38,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930431209]
[2025-02-06 02:42:38,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930431209] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:38,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:38,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:42:38,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369032921]
[2025-02-06 02:42:38,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:38,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:42:38,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:38,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:42:38,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:42:38,991 INFO  L87              Difference]: Start difference. First operand 3337 states and 5480 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:39,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:39,224 INFO  L93              Difference]: Finished difference Result 11731 states and 19359 transitions.
[2025-02-06 02:42:39,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:42:39,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460
[2025-02-06 02:42:39,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:39,258 INFO  L225             Difference]: With dead ends: 11731
[2025-02-06 02:42:39,258 INFO  L226             Difference]: Without dead ends: 8397
[2025-02-06 02:42:39,267 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:42:39,268 INFO  L435           NwaCegarLoop]: 452 mSDtfsCounter, 489 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:39,268 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1351 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-06 02:42:39,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8397 states.
[2025-02-06 02:42:39,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 7169.
[2025-02-06 02:42:39,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7169 states, 6784 states have (on average 1.6367924528301887) internal successors, (11104), 6796 states have internal predecessors, (11104), 352 states have call successors, (352), 32 states have call predecessors, (352), 32 states have return successors, (352), 340 states have call predecessors, (352), 352 states have call successors, (352)
[2025-02-06 02:42:39,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 11808 transitions.
[2025-02-06 02:42:39,475 INFO  L78                 Accepts]: Start accepts. Automaton has 7169 states and 11808 transitions. Word has length 460
[2025-02-06 02:42:39,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:39,476 INFO  L471      AbstractCegarLoop]: Abstraction has 7169 states and 11808 transitions.
[2025-02-06 02:42:39,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:39,480 INFO  L276                IsEmpty]: Start isEmpty. Operand 7169 states and 11808 transitions.
[2025-02-06 02:42:39,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:39,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:39,491 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:39,491 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 02:42:39,491 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:39,491 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:39,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -1474728279, now seen corresponding path program 1 times
[2025-02-06 02:42:39,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:39,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120754142]
[2025-02-06 02:42:39,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:39,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:39,520 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:39,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:39,755 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:39,755 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:40,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:40,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:40,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120754142]
[2025-02-06 02:42:40,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120754142] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:40,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:40,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 02:42:40,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384340963]
[2025-02-06 02:42:40,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:40,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 02:42:40,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:40,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 02:42:40,122 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-06 02:42:40,122 INFO  L87              Difference]: Start difference. First operand 7169 states and 11808 transitions. Second operand  has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:44,847 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:42:46,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:46,010 INFO  L93              Difference]: Finished difference Result 24557 states and 40026 transitions.
[2025-02-06 02:42:46,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-06 02:42:46,015 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460
[2025-02-06 02:42:46,015 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:46,057 INFO  L225             Difference]: With dead ends: 24557
[2025-02-06 02:42:46,058 INFO  L226             Difference]: Without dead ends: 17391
[2025-02-06 02:42:46,076 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2025-02-06 02:42:46,079 INFO  L435           NwaCegarLoop]: 463 mSDtfsCounter, 1608 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 208 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:46,079 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 1853 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1124 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time]
[2025-02-06 02:42:46,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17391 states.
[2025-02-06 02:42:46,433 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17391 to 12533.
[2025-02-06 02:42:46,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12533 states, 11824 states have (on average 1.6224627875507442) internal successors, (19184), 11860 states have internal predecessors, (19184), 624 states have call successors, (624), 84 states have call predecessors, (624), 84 states have return successors, (624), 588 states have call predecessors, (624), 624 states have call successors, (624)
[2025-02-06 02:42:46,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 20432 transitions.
[2025-02-06 02:42:46,482 INFO  L78                 Accepts]: Start accepts. Automaton has 12533 states and 20432 transitions. Word has length 460
[2025-02-06 02:42:46,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:46,484 INFO  L471      AbstractCegarLoop]: Abstraction has 12533 states and 20432 transitions.
[2025-02-06 02:42:46,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66)
[2025-02-06 02:42:46,485 INFO  L276                IsEmpty]: Start isEmpty. Operand 12533 states and 20432 transitions.
[2025-02-06 02:42:46,500 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:46,500 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:46,500 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,500 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-06 02:42:46,500 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:46,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:46,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -1263377366, now seen corresponding path program 1 times
[2025-02-06 02:42:46,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:46,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699197918]
[2025-02-06 02:42:46,501 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:46,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:46,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:46,780 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:46,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:46,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:47,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:47,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:47,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699197918]
[2025-02-06 02:42:47,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699197918] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:47,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:47,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 02:42:47,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679704566]
[2025-02-06 02:42:47,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:47,242 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-06 02:42:47,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:47,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 02:42:47,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-06 02:42:47,243 INFO  L87              Difference]: Start difference. First operand 12533 states and 20432 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:47,928 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 02:42:47,928 INFO  L93              Difference]: Finished difference Result 46803 states and 76163 transitions.
[2025-02-06 02:42:47,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 02:42:47,929 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460
[2025-02-06 02:42:47,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-06 02:42:48,003 INFO  L225             Difference]: With dead ends: 46803
[2025-02-06 02:42:48,003 INFO  L226             Difference]: Without dead ends: 34273
[2025-02-06 02:42:48,022 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:42:48,023 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 710 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-06 02:42:48,024 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1116 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-06 02:42:48,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34273 states.
[2025-02-06 02:42:48,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34273 to 29433.
[2025-02-06 02:42:48,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29433 states, 28216 states have (on average 1.620499007655231) internal successors, (45724), 28292 states have internal predecessors, (45724), 1048 states have call successors, (1048), 168 states have call predecessors, (1048), 168 states have return successors, (1048), 972 states have call predecessors, (1048), 1048 states have call successors, (1048)
[2025-02-06 02:42:48,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29433 states to 29433 states and 47820 transitions.
[2025-02-06 02:42:48,814 INFO  L78                 Accepts]: Start accepts. Automaton has 29433 states and 47820 transitions. Word has length 460
[2025-02-06 02:42:48,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-06 02:42:48,817 INFO  L471      AbstractCegarLoop]: Abstraction has 29433 states and 47820 transitions.
[2025-02-06 02:42:48,817 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:48,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 29433 states and 47820 transitions.
[2025-02-06 02:42:48,850 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 461
[2025-02-06 02:42:48,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-06 02:42:48,851 INFO  L218           NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:48,851 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-06 02:42:48,851 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-06 02:42:48,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 02:42:48,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 2034517577, now seen corresponding path program 1 times
[2025-02-06 02:42:48,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 02:42:48,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273402038]
[2025-02-06 02:42:48,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 02:42:48,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 02:42:48,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes.
[2025-02-06 02:42:49,442 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements.
[2025-02-06 02:42:49,443 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 02:42:49,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 02:42:50,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked.
[2025-02-06 02:42:50,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 02:42:50,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273402038]
[2025-02-06 02:42:50,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273402038] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 02:42:50,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 02:42:50,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-06 02:42:50,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897713112]
[2025-02-06 02:42:50,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 02:42:50,446 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-06 02:42:50,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 02:42:50,446 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-06 02:42:50,446 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-02-06 02:42:50,447 INFO  L87              Difference]: Start difference. First operand 29433 states and 47820 transitions. Second operand  has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)
[2025-02-06 02:42:56,133 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:00,136 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:04,140 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:08,147 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:12,150 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:16,154 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:20,167 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:24,170 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:28,177 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:32,183 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:36,186 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:40,203 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:44,212 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:48,216 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:52,223 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:43:56,230 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2025-02-06 02:44:00,233 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []